On the Reliability Function of Variable-Rate Slepian-Wolf Coding†
AbstractThe 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 region. It is shown that variable-rate Slepian-Wolf codes can significantly outperform fixed-rate Slepian-Wolf codes in terms of rate-error tradeoff. Variable-rate Slepian-Wolf coding with rate below the Slepian-Wolf limit is also analyzed. 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. View Full-Text
Share & Cite This Article
Chen, J.; He, D.-K.; Jagmohan, A.; Lastras-Montaño, L.A. On the Reliability Function of Variable-Rate Slepian-Wolf Coding. Entropy 2017, 19, 389.
Chen J, He D-K, Jagmohan A, Lastras-Montaño LA. On the Reliability Function of Variable-Rate Slepian-Wolf Coding. Entropy. 2017; 19(8):389.Chicago/Turabian Style
Chen, Jun; He, Da-ke; Jagmohan, Ashish; Lastras-Montaño, Luis A. 2017. "On the Reliability Function of Variable-Rate Slepian-Wolf Coding." Entropy 19, no. 8: 389.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.