On the Dispersions of Three Network Information Theory Problems

The authors characterize fundamental limits for distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel and the asymmetric broadcast channel in the finite blocklength setting. For the Slepian-Wolf problem, they introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersion quantities that have gained interest in the recent literature. They 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 asymptotic Slepian-Wolf scenario.

Provided by: University of Wisconsin-La Crosse Topic: Networking Date Added: Feb 2012 Format: PDF

Find By Topic