pith. sign in

arxiv: 1505.01137 · v1 · pith:QA623B6Onew · submitted 2015-05-05 · 💻 cs.IT · math.IT

On the Reliability Function of Variable-Rate Slepian-Wolf Coding

classification 💻 cs.IT math.IT
keywords slepian-wolfcodesfunctionreliabilityvariable-ratecodinglimitrate
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.