{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:18:07Z","timestamp":1761401887272,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T00:00:00Z","timestamp":1501200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e19080389","type":"journal-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T10:14:34Z","timestamp":1501236874000},"page":"389","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["On the Reliability Function of Variable-Rate Slepian-Wolf Coding"],"prefix":"10.3390","volume":"19","author":[{"given":"Jun","family":"Chen","sequence":"first","affiliation":[{"name":"College of Electronic Information and Automation, Tianjin University of Science and Technology, Tianjin 300222, China"},{"name":"Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON L8S 4K1, Canada"}]},{"given":"Da-ke","family":"He","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA 94043, USA"}]},{"given":"Ashish","family":"Jagmohan","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA"}]},{"given":"Luis","family":"Lastras-Monta\u00f1o","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA"}]}],"member":"1968","published-online":{"date-parts":[[2017,7,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TIT.1982.1056524","article-title":"Linear codes for sources and source networks: Error exponents, universal coding","volume":"28","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TIT.2002.808103","article-title":"Distributed source coding using syndromes (DISCUS): Design and construction","volume":"49","author":"Pradhan","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2534","DOI":"10.1109\/TCOMM.2009.09.080018","article-title":"The equivalence between Slepian-Wolf coding and channel coding under density evolution","volume":"57","author":"Chen","year":"2009","journal-title":"IEEE Trans. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TCOMM.2010.02.090034","article-title":"LDPC code design for asynchronous Slepian-Wolf coding","volume":"58","author":"Sun","year":"2010","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1908","DOI":"10.1109\/18.340465","article-title":"Universal coding for the Slepian-Wolf data compression system and the strong converse theorem","volume":"40","author":"Oohama","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (1981). Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1981.1056281","article-title":"Graph decomposition: A new key to coding theorems","volume":"27","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1979.1056003","article-title":"Reliability function of a discrete memoryless channel at rates above capacity","volume":"25","author":"Dueck","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","unstructured":"Gallager, R.G. (1968). Information Theory and Reliable Communication, Wiley."},{"key":"ref_11","unstructured":"Gallager, R.G. (Source Coding with Side Information and Universal Coding, 1976). Source Coding with Side Information and Universal Coding, MIT LIDS Technical Report (LIDS-P-937). Unpublished work."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, J., He, D.-K., Jagmohan, A., and Lastras-Monta\u00f1o, L. (2007, January 24\u201329). On the redundancy-error tradeoff in Slepian-Wolf coding and channel coding. Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France.","DOI":"10.1109\/ISIT.2007.4557129"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/TIT.1980.1056166","article-title":"Towards a general theory of source networks","volume":"26","year":"1980","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5575","DOI":"10.1109\/TIT.2009.2032815","article-title":"On the linear codebook-level duality between Slepian-Wolf coding and channel coding","volume":"55","author":"Chen","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/TIT.1982.1056514","article-title":"Good codes can be produced by a few permutations","volume":"28","author":"Ahlswede","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"4006","DOI":"10.1109\/TIT.2009.2025527","article-title":"On the duality between Slepian-Wolf coding and channel coding under mismatched decoding","volume":"55","author":"Chen","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","first-page":"220","article-title":"Coloring hypergraphs: A new approach to multi-user source coding\u2014II","volume":"5","author":"Ahlswede","year":"1980","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5607","DOI":"10.1109\/TIT.2009.2032803","article-title":"On the redundancy of Slepian-Wolf coding","volume":"55","author":"He","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1109\/TIT.2015.2405537","article-title":"Optimum tradeoffs between the error exponent and the excess-rate exponent of variable-rate Slepian-Wolf coding","volume":"61","author":"Weinberger","year":"2015","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/8\/389\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:44:20Z","timestamp":1760208260000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/8\/389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,28]]},"references-count":19,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2017,8]]}},"alternative-id":["e19080389"],"URL":"https:\/\/doi.org\/10.3390\/e19080389","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,7,28]]}}}