Next Article in Journal
On Entropy Test for Conditionally Heteroscedastic Location-Scale Time Series Models
Next Article in Special Issue
Channel Coding and Source Coding With Increased Partial Side Information
Previous Article in Journal
On Increased Arc Endurance of the Cu–Cr System Materials
Previous Article in Special Issue
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel
Article Menu
Issue 8 (August) cover image

Export Article

Open AccessArticle

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

1
College of Electronic Information and Automation, Tianjin University of Science and Technology, Tianjin 300222, China
2
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON L8S 4K1, Canada
3
Google, Mountain View, CA 94043, USA
4
IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA
*
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in the 45th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 26–28 September 2007.
Entropy 2017, 19(8), 389; https://doi.org/10.3390/e19080389
Received: 13 June 2017 / Revised: 14 July 2017 / Accepted: 27 July 2017 / Published: 28 July 2017
(This article belongs to the Special Issue Multiuser Information Theory)
  |  
PDF [934 KB, uploaded 30 July 2017]
  |  

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 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
Keywords: channel coding; duality; reliability function; Slepian-Wolf coding channel coding; duality; reliability function; Slepian-Wolf coding
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top