The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Underwater acoustic sensor networks (UASNs) are widely used in many application. However, the underwater acoustic channel poses many challenges for reliable data transmission protocol design. In this paper, we propose a new data transmission protocol based on Fountain codes and Selective-repeat ARQ scheme (FSR-ARQ). The new approach utilizes the packet error correction ability of rateless code and...
High-speed serial data communication is now very popular for connecting various resources in high-performance computing systems. In such high-speed serial links, a line coding is important to control the run length (RL) and the running disparity (RD), because a large run length causes insufficient transitions on data-links that make it difficult to perform reliable clock and data recovery (CDR), and...
In an unreliable cluster-based, broadcast-oriented vehicular network setting, we investigate the transmission reliability and throughput performance of random network coding (RNC) as a function of the packet generate rate. Our proposed model consists of a source vehicle broadcasting packets to a set of receivers (i.e. one-to-many) over independent broadcast erasure channels. The source vehicle performs...
We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC). For the VLF setup, the achievability bound relies on a scheme that maps each message onto a variable-length Huffman...
Live coding is a performance discipline that considers code as an interface. The act of writing, deleting and modifying code allows a performer to directly interact with their context through the creation of computational side effects such as sounds and visuals. A commonly used tool for many kinds of expression is randomness which enables the introduction of automated variation into performances....
Algebraic-geometric (AG) codes have long been considered as a possible candidate to replace Reed-Solomon (RS) codes. However, their decoding remains complex and infeasible to implement. Addressing this challenge, our paper proposes a low-complexity Chase (LCC) decoding algorithm for the most popular class of AG codes - Hermitian codes. The LCC decoding is realised by formulating decoding test-vectors,...
In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of...
Coset coding is often used in the study of the physical layer security based on wiretap channel model. As almost every secure coding schemes using coset codes need a precise prediction of the channel state information (CSI), they are much more difficult to implement. To solve this problem, we propose a concatenated coding scheme combined of polar code and fountain code in wiretap channel model on...
High reliability and low latency are key requirements for a number of upcoming use cases and applications in mobile communication networks. In order to address the requirements, we present statistical models which capture the most important radio propagation phenomena, such as path loss, shadowing, and small scale fading. The models enable the evaluation of trade-offs between reliability, achievable...
Named Data Networking (NDN) is a promising future Internet architecture which retrieves the content using their names. Content names composed of strings separated by '/' are stored in the NDN Forwarding Information Base (FIB) to forward the incoming packets further. To retrieve content through their names poses two main challenges for the NDN FIB: high memory consumption and high lookup time. Therefore,...
For lower storage costs, storage systems are increasingly transitioning to the use of erasure codes instead of replication. However, the increase in the amount of data to be read and transferred during recovery for an erasure-coded system results in the problem of high degraded read latency. We design a new parallel degraded read method, Collective Reconstruction Read, which aims to overcome the problem...
Network coding (NC) is a promising approach to efficiently enhance the robustness and recovery capacity in the Underwater acoustic sensor network (UWASN). However, the undesired transmission redundancy and additional resource limit the further development for NC with applications to the UWASN. Based on the analysis of intermediate nodes, a new approach called encoding anticipation mechanism for network...
The event upset is the main concern of reliability in space communication. Among all event upset tolerant techniques, error detecting and correcting coding technique is simple and effective to protect the communication of micro-processor between the memory and register. This paper propose a second hamming code technique which can improve the error detecting and error correcting capacity based on minimum...
In this paper we study the design of LDPC decoding scheme for very high throughput optical communications for a full self-seeded optical architecture dedicated to cloud radio access network (C-RAN). The objective of this paper is to demonstrate the potentiality of Bit Flipping (BF) algorithms. It is shown that the Gradient Descent Bit Flipping (GDBF) algorithm with a little improvement is suitable...
With the increase of network bandwidth and the popularity of Internet, cloud storage has become one of the most widely used of cloud computing. Since the user may have a variety of terminal such as PC, notebook computers, tablet PCs and smart phones, and may access data in different places and on different terminal, cloud storage provides the most suitable solution to share data between these devices...
We investigate reliable data packet delivery employing random linear packet coding for a half-duplex underwater acoustic link. Packet coding is performed on a group of M information-bearing packets so as to form N ≥ M coded packets, where N is chosen such that a pre-specified probability of successful decoding is maintained at the receiver. We regard a group of N coded packets as one super-packet,...
This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches...
The increasing popularity of cloud services is leading people to store their data to the Internet. Cloud storage services, by promising the access of your data anywhere at any time, do not provide users with sufficient transparency to allow them to know exactly how their data is stored and who can access and control it. The proposed cloud storage service offers users the possibility to control their...
Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of required block downloads for repair thanks to the sparse nature of their factor graph representation. In particular, with a careful construction of the factor graph, both...
The positive and negative syndrome scale (PANSS) and Andreasen remission criteria have contextually been used to characterize schizophrenia symptoms in clinical trials. However, few studies have investigated the relationships among the possible scores of these two psychometric tools. The present study intends to address this topic starting from a theoretical combinatorial analysis of the possible...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.