Coding Theorems for Asynchronous Slepian–Wolf Coding Systems
6
TL;DR: In this article, the authors consider the situation in which the Slepian-Wolf (SW) coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay.
read more
Abstract: The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationary memoryless and the probability mass function (PMF) of the sources is unknown but the system knows that it belongs to a certain set of PMFs. For this asynchronous SW coding system, we clarify the achievable rate region which is the set of rate pairs of encoders such that the decoding error probability vanishes as the blocklength tends to infinity. We show that this region does not always coincide with that of the synchronous SW coding system in which each encoder samples a source sequence without any delay.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Universal Decoding for Asynchronous Slepian-Wolf Encoding
TL;DR: In this paper, the authors considered the problem of source coding of two correlated memoryless sources using separate encoders and a joint decoder, and proposed a universal decoder that is asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved.
2
•Posted Content
Universal Decoding for Asynchronous Slepian-Wolf Encoding
TL;DR: This work proposes a universal decoder, independent of the unknown source parameters and the relative delay, and at the same time, asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved.
Performance analysis of one-source-with-one-helper transmission over shadowed κ $\kappa$ - μ $\mu$ fading multiple access channels
TL;DR: In this paper , the performance of correlated sources transmission over multiple access shadowed κ $\kappa$ - μ $\mu$ fading channels is investigated, in which one of the correlated sources needs to be recovered at the destination, whereas the other serves as a helper.
Universal Decoding for Asynchronous Slepian-Wolf Encoding
Neri Merhav
- 11 Apr 2021
TL;DR: In this article, the authors considered the problem of source coding of two correlated memoryless sources using separate encoders and a joint decoder, and proposed a universal decoder that is asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved.
Asynchronous Random Access Data Compression
Siming Sun,Michelle Effros +1 more
- 19 Mar 2024
TL;DR: Asynchronous random access data compression framework bounds achievable performance and eliminates block synchronization. Achievability bound demonstrates first-order average rate equal to weighted average of point-to-point and multiple access achievable sum rate.
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
•Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
- 26 Sep 2014
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
4.2K