On the dispersions of three network information theory problems
On the dispersions of three network information theory problems
We characterize fundamental limits for the Slepian-Wolf problem, the multiple-access channel and the asymmetric broadcast channel in the finite blocklength setting. For the Slepian-Wolf problem (distributed lossless source coding), we introduce a fundamental quantity known as the entropy dispersion matrix. We show that if this matrix is positive-definite, the optimal …