The dispersion of Slepian-Wolf coding

Vincent Y F Tan, Oliver Kosut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages915-919
Number of pages5
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period7/1/127/6/12

Fingerprint

Coding
Entropy
Information theory
Curved Boundary
Multiple Access Channel
Dispersions
Gaussian Approximation
Source Coding
Optimal Rates
Byproducts
Error Probability
Information Theory
Positive definite
Rate of Convergence
Scalar
Numerical Examples

Keywords

  • Dispersion
  • Second-order Rates
  • Slepian-Wolf

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Tan, V. Y. F., & Kosut, O. (2012). The dispersion of Slepian-Wolf coding. In IEEE International Symposium on Information Theory - Proceedings (pp. 915-919). [6284695] https://doi.org/10.1109/ISIT.2012.6284695

The dispersion of Slepian-Wolf coding. / Tan, Vincent Y F; Kosut, Oliver.

IEEE International Symposium on Information Theory - Proceedings. 2012. p. 915-919 6284695.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tan, VYF & Kosut, O 2012, The dispersion of Slepian-Wolf coding. in IEEE International Symposium on Information Theory - Proceedings., 6284695, pp. 915-919, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6284695
Tan VYF, Kosut O. The dispersion of Slepian-Wolf coding. In IEEE International Symposium on Information Theory - Proceedings. 2012. p. 915-919. 6284695 https://doi.org/10.1109/ISIT.2012.6284695
Tan, Vincent Y F ; Kosut, Oliver. / The dispersion of Slepian-Wolf coding. IEEE International Symposium on Information Theory - Proceedings. 2012. pp. 915-919
@inproceedings{f6cb617cec834495aae280e0e37b7e5b,
title = "The dispersion of Slepian-Wolf coding",
abstract = "We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.",
keywords = "Dispersion, Second-order Rates, Slepian-Wolf",
author = "Tan, {Vincent Y F} and Oliver Kosut",
year = "2012",
doi = "10.1109/ISIT.2012.6284695",
language = "English (US)",
isbn = "9781467325790",
pages = "915--919",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - The dispersion of Slepian-Wolf coding

AU - Tan, Vincent Y F

AU - Kosut, Oliver

PY - 2012

Y1 - 2012

N2 - We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.

AB - We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.

KW - Dispersion

KW - Second-order Rates

KW - Slepian-Wolf

UR - http://www.scopus.com/inward/record.url?scp=84867527299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867527299&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284695

DO - 10.1109/ISIT.2012.6284695

M3 - Conference contribution

SN - 9781467325790

SP - 915

EP - 919

BT - IEEE International Symposium on Information Theory - Proceedings

ER -