On the dispersions of three network information theory problems

Vincent Y F Tan, Oliver Kosut

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel, and the asymmetric broadcast channel. For the two-encoder Slepian-Wolf problem, we introduce a quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersions that have gained interest recently. We prove a global dispersion result that can be expressed in terms of this entropy dispersion matrix and provides intuition on the approximate rate losses at a given blocklength and error probability. To gain better intuition about the rate at which the nonasymptotic rate region converges to the Slepian-Wolf boundary, we define and characterize two operational dispersions: 1) the local dispersion and 2) the weighted sum-rate dispersion. The former represents the rate of convergence to a point on the Slepian-Wolf boundary, whereas the latter represents the fastest rate for which a weighted sum of the two rates converges to its asymptotic fundamental limit. Interestingly, when we approach either of the two corner points, the local dispersion is characterized not by a univariate Gaussian, but a bivariate one as well as a subset of off-diagonal elements of the aforementioned entropy dispersion matrix. Finally, we demonstrate the versatility of our achievability proof technique by providing inner bounds for the multiple-access channel and the asymmetric broadcast channel in terms of dispersion matrices. All our proofs are unified by a so-called vector rate redundancy theorem, which is proved using the multidimensional Berry-Esséen theorem.

Original languageEnglish (US)
Article number6665138
Pages (from-to)888-903
Number of pages16
JournalIEEE Transactions on Information Theory
Volume60
Issue number2
DOIs
StatePublished - Feb 2014

Fingerprint

information theory
Information theory
entropy
Dispersions
intuition
broadcast
redundancy
Entropy
coding
Redundancy

Keywords

  • asymmetric broadcast channel
  • Dispersion
  • multiple-access channel
  • network information theory
  • second-order coding rates
  • Slepian-Wolf

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On the dispersions of three network information theory problems. / Tan, Vincent Y F; Kosut, Oliver.

In: IEEE Transactions on Information Theory, Vol. 60, No. 2, 6665138, 02.2014, p. 888-903.

Research output: Contribution to journalArticle

@article{2c808015cb7640ffbd33db3a6f2a6166,
title = "On the dispersions of three network information theory problems",
abstract = "We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel, and the asymmetric broadcast channel. For the two-encoder Slepian-Wolf problem, we introduce a quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersions that have gained interest recently. We prove a global dispersion result that can be expressed in terms of this entropy dispersion matrix and provides intuition on the approximate rate losses at a given blocklength and error probability. To gain better intuition about the rate at which the nonasymptotic rate region converges to the Slepian-Wolf boundary, we define and characterize two operational dispersions: 1) the local dispersion and 2) the weighted sum-rate dispersion. The former represents the rate of convergence to a point on the Slepian-Wolf boundary, whereas the latter represents the fastest rate for which a weighted sum of the two rates converges to its asymptotic fundamental limit. Interestingly, when we approach either of the two corner points, the local dispersion is characterized not by a univariate Gaussian, but a bivariate one as well as a subset of off-diagonal elements of the aforementioned entropy dispersion matrix. Finally, we demonstrate the versatility of our achievability proof technique by providing inner bounds for the multiple-access channel and the asymmetric broadcast channel in terms of dispersion matrices. All our proofs are unified by a so-called vector rate redundancy theorem, which is proved using the multidimensional Berry-Ess{\'e}en theorem.",
keywords = "asymmetric broadcast channel, Dispersion, multiple-access channel, network information theory, second-order coding rates, Slepian-Wolf",
author = "Tan, {Vincent Y F} and Oliver Kosut",
year = "2014",
month = "2",
doi = "10.1109/TIT.2013.2291231",
language = "English (US)",
volume = "60",
pages = "888--903",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - On the dispersions of three network information theory problems

AU - Tan, Vincent Y F

AU - Kosut, Oliver

PY - 2014/2

Y1 - 2014/2

N2 - We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel, and the asymmetric broadcast channel. For the two-encoder Slepian-Wolf problem, we introduce a quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersions that have gained interest recently. We prove a global dispersion result that can be expressed in terms of this entropy dispersion matrix and provides intuition on the approximate rate losses at a given blocklength and error probability. To gain better intuition about the rate at which the nonasymptotic rate region converges to the Slepian-Wolf boundary, we define and characterize two operational dispersions: 1) the local dispersion and 2) the weighted sum-rate dispersion. The former represents the rate of convergence to a point on the Slepian-Wolf boundary, whereas the latter represents the fastest rate for which a weighted sum of the two rates converges to its asymptotic fundamental limit. Interestingly, when we approach either of the two corner points, the local dispersion is characterized not by a univariate Gaussian, but a bivariate one as well as a subset of off-diagonal elements of the aforementioned entropy dispersion matrix. Finally, we demonstrate the versatility of our achievability proof technique by providing inner bounds for the multiple-access channel and the asymmetric broadcast channel in terms of dispersion matrices. All our proofs are unified by a so-called vector rate redundancy theorem, which is proved using the multidimensional Berry-Esséen theorem.

AB - We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel, and the asymmetric broadcast channel. For the two-encoder Slepian-Wolf problem, we introduce a quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersions that have gained interest recently. We prove a global dispersion result that can be expressed in terms of this entropy dispersion matrix and provides intuition on the approximate rate losses at a given blocklength and error probability. To gain better intuition about the rate at which the nonasymptotic rate region converges to the Slepian-Wolf boundary, we define and characterize two operational dispersions: 1) the local dispersion and 2) the weighted sum-rate dispersion. The former represents the rate of convergence to a point on the Slepian-Wolf boundary, whereas the latter represents the fastest rate for which a weighted sum of the two rates converges to its asymptotic fundamental limit. Interestingly, when we approach either of the two corner points, the local dispersion is characterized not by a univariate Gaussian, but a bivariate one as well as a subset of off-diagonal elements of the aforementioned entropy dispersion matrix. Finally, we demonstrate the versatility of our achievability proof technique by providing inner bounds for the multiple-access channel and the asymmetric broadcast channel in terms of dispersion matrices. All our proofs are unified by a so-called vector rate redundancy theorem, which is proved using the multidimensional Berry-Esséen theorem.

KW - asymmetric broadcast channel

KW - Dispersion

KW - multiple-access channel

KW - network information theory

KW - second-order coding rates

KW - Slepian-Wolf

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

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

U2 - 10.1109/TIT.2013.2291231

DO - 10.1109/TIT.2013.2291231

M3 - Article

AN - SCOPUS:84893459202

VL - 60

SP - 888

EP - 903

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

M1 - 6665138

ER -