By Topic

A note on the dispersion of network problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Eli Haim ; Dept. of EE-Systems, TAU, Tel Aviv, Israel ; Yuval Kochman ; Uri Erez

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.

Published in:

Electrical & Electronics Engineers in Israel (IEEEI), 2012 IEEE 27th Convention of

Date of Conference:

14-17 Nov. 2012