pith. machine review for the scientific record. sign in

arxiv: 1706.07731 · v2 · submitted 2017-06-23 · 💻 cs.IT · math.IT

Recognition: unknown

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords feedbackbroadcastboundscasechannelchannelscodesdispersion
0
0 comments X
read the original abstract

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case. In particular, for a certain class of antisymmetric broadcast channels, we show that the dispersion is halved. For the variable-length-code setup, we demonstrate that the channel dispersion is zero.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.