On the Reliability Function of Variable-Rate Slepian-Wolf Coding
Abstract
The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepian-Wolf codes can significantly outperform fixed-rate Slepian-Wolf codes in terms of rate-error tradeoff. The reliability function of variable-rate Slepian-Wolf coding with rate below the Slepian-Wolf limit is determined. In sharp contrast with fixed-rate Slepian-Wolf codes for which the correct decoding probability decays to zero exponentially fast if the rate is below the Slepian-Wolf limit, the correct decoding probability of variable-rate Slepian-Wolf codes can be bounded away from zero.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2015
- DOI:
- 10.48550/arXiv.1505.01137
- arXiv:
- arXiv:1505.01137
- Bibcode:
- 2015arXiv150501137C
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- This is an old manuscript written in 2007-2008 based on our 2007 Allerton conference paper with the same title