Universal decoding for source-channel coding with side information
From MaRDI portal
Publication:344352
DOI10.4310/CIS.2016.V16.N1.A2zbMATH Open1360.94441arXiv1507.01255OpenAlexW2513411555MaRDI QIDQ344352FDOQ344352
Authors: Neri Merhav 
Publication date: 22 November 2016
Published in: Communications in Information and Systems (Search for Journal in Brave)
Abstract: We consider a setting of Slepian--Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, assuming first that they are both memoryless. Exact analysis of the random-binning/random-coding error exponent of this universal decoder shows that it is the same as the one achieved by the optimal maximum a-posteriori (MAP) decoder. Previously known results on universal Slepian-Wolf source decoding, universal channel decoding, and universal source-channel decoding, are all obtained as special cases of this result. Subsequently, we further generalize the results in several directions, including: (i) finite-state sources and finite-state channels, along with a universal decoding metric that is based on Lempel-Ziv parsing, (ii) arbitrary sources and channels, where the universal decoding is with respect to a given class of decoding metrics, and (iii) full (symmetric) Slepian-Wolf coding, where both source streams are separately fed into random-binning source encoders, followed by random channel encoders, which are then jointly decoded by a universal decoder.
Full work available at URL: https://arxiv.org/abs/1507.01255
Recommendations
- Cyclic Division Algebras: A Tool for Space-Time Coding
- Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics
- On zero-error source coding with decoder side information
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Zero-Error Source–Channel Coding With Side Information
- Universal decoding for finite-state channels
- Side-Information Scalable Source Coding
- Universal Decoding for Gaussian Intersymbol Interference Channels
- On source coding with side information via a multiple-access channel and related problems in multi-user information theory
- Constrained Source-Coding With Side Information
Cited In (7)
- Multiple description coding with side information: practical scheme and iterative decoding
- Universal Decoding for Gaussian Intersymbol Interference Channels
- Side-Information Scalable Source Coding
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Universal decoding for finite-state channels
- Joint iterative decoding and estimation for side-informed data hiding
- Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
This page was built for publication: Universal decoding for source-channel coding with side information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344352)
