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.
The binary chief executive officer (CEO) problem with an arbitrary number of agents is considered in this paper. A scheme which separates the reconstruction of observations and the final decision of a common source is assumed. Hence, we first derive the outer bound for the rate- distortion region by providing the converse proof of a binary multiterminal source coding problem which is the key to solve...
This work proposes a construction for high-rate generalized concatenated (GC) codes. The proposed codes are well suited for error correction in flash memories for high reliability data storage. The GC codes are constructed from inner nested binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer Reed-Solomon (RS) codes. For the inner codes we propose extended BCH codes, where we apply single parity-check...
We consider the advanced digital noncoherent demodulator of "integrally" coded binary phase-shift keyed signals. This demodulator requires carrying out the minimum simple arithmetic operations over the input signal period. We study its noise immunity, and we show that for relatively short codes “integrally” demodulation leads to considerable gain in comparison with step-by-step demodulation...
In this paper, we analyze Luby Transform (LT) codes with unequal recovery time (URT-LT) and intermediate feedback. Different sets of information symbols within a message block are allocated different priorities, where the higher prioritized sets are to be recovered in a shorter time. We divide the encoding process into stages where in each stage different sets are allocated different selection probabilities...
In this paper, we investigate the performance of energy harvesting relay-aided cooperative system wherein, the source node transmits hierarchical signal to the relay and destination nodes. But, since in cooperative networks relays are often nearer to the source than the destination, the relay node is able to decode multi-resolution signal whereas, the destination is only capable of detecting the most...
An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to identify the minimum number of transmissions (optimal length) to be made by the source through noiseless channels so that all the receivers can decode their wanted messages...
We consider the problem of transmitting confidential messages over a two receiver broadcast channel. Two private messages are to be communicated, one to each of the two receivers. Each message is to be kept secret from the unintended receiver. Secret keys are available at fixed rates between each receiver and the transmitter. Various regimes of the key rates are described and achievable schemes are...
Classically, the quantization of the soft information supplied to a finite-precision decoder is chosen to optimize a certain criterion which does not depend on the characteristics of the existing code. This work studies code-aware quantizers, for finite-precision min-sum decoders, which optimize the noise threshold of the existing family of Low-Density Parity-Check (LDPC) codes. We propose a code-aware...
State-of-the-art NAND flash chips experience significant channel noise impairments and raise several data reliability issues. To overcome these issues, low-density parity-check (LDPC) codes are becoming the main stream error-correcting-codes in flash memory controllers. Consequently, the long belief-propagation (BP) decoding latency starts to deteriorate the system performance. In this paper, a low-complexity...
We consider the problem of reliable and information theoretically secure communication over adversarial multi-path networks. The adversary, hidden in the multi-path network, is able to eavesdrop on and jam (possibly distinct) subsets of links. We study three types of problems — communication in the presence of non-causal adversaries, causal adversaries, and causal adversaries with passive feedback...
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode input sequences emitted from two correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder runs with...
Hybrid Automatic Repeat reQuest (HARQ) techniques are largely used in the context of wireless communications systems especially in the last few years, being employed in the latest cellular systems, including the Long Term Evolution (LTE) standard. Such schemes have been widely studied in literature; however, in this paper we are interested in applying the results of Polyanskiy-Poor-Verdù on the finite...
Error and erasure exponents for the asymmetric broadcast channel are analyzed. The focus of the error analysis is on the main receiver where, nominally, both messages are to be decoded. A two-step decoding algorithm is proposed and analyzed. This receiver first attempts to decode both messages, failing which, it attempts to decode only the message representing the coarser information, i.e., the cloud...
We prove that N-user Gaussian multiple access channels (MACs) admit the strong converse. This means that every sequence of codes with asymptotic average error probabilities smaller than one has rate tuples that lie in the pentagonal region prescribed by Cover and Wyner.
In many practical communication systems, the channel is corrupted by non-Gaussian impulsive noise (IN). It introduces decoding metric mismatch for the traditional Euclidean metric decoders and limits system performance. The situation is worsen by the practical difficulty in accurately estimating the IN statistics. Recently, some metric clipping based decoders with a properly chosen clipping threshold...
In this paper, the pessimistic multi letter common randomness assisted secrecy capacity for the Arbitrarily Varying Wiretap Channel (AVWC) under input and state constraints is derived.
Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS). It turns out that, the optimal source code may not index the conventional source-typical...
We provide the first constructions of a new family of error-correcting codes called “energy-adaptive codes.” These codes are designed to enable adaptive circuit implementations that minimize the total system-level energy based on varying distances and target error probabilities. Recent work has explored fundamental limits and practical strategies for minimizing total (transmit + circuit) power, considering...
We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity recently derived in [1]. The aforementioned...
In this paper we consider regular low-density parity-check codes over a binary-symmetric channel in the decoding regime. We prove that up to a certain noise threshold the bit-error probability of the bit-sampling decoder converges in mean to zero over the code ensemble and the channel realizations. To arrive at this result we show that the bit-error probability of the sampling decoder is equal to...
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.