A note on the dispersion of network problems

Eli Haim*, Yuval Kochman, Uri Erez

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Recently there has been significant interest in the analysis of finite-blocklength performance in different settings. Specifically, there is an effort to extend the performance bounds, as well as the Gaussian approximation (dispersion) beyond point-to-point settings. This proves to be a difficult task, as the performance may be governed by multiple dependent constraints. In this work we shed light on these difficulties, using the multiple-access channel as a test case. We show that a local notion of dispersion is more informative than that of dispersion regions sought after thus far. On the positive side, we show that for channels possessing certain symmetry, the dispersion problem reduces to the single-user one. Furthermore, for such channels, linear codes enable to translate single-user achievability bounds to the multiple-access channel.

Original languageAmerican English
Title of host publication2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
DOIs
StatePublished - 2012
Event2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 - Eilat, Israel
Duration: 14 Nov 201217 Nov 2012

Publication series

Name2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012

Conference

Conference2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Country/TerritoryIsrael
CityEilat
Period14/11/1217/11/12

Fingerprint

Dive into the research topics of 'A note on the dispersion of network problems'. Together they form a unique fingerprint.

Cite this