How to beat the sphere-packing bound with feedback
| dc.creator | Sahai, Anant | |
| dc.date | 2006-10-24 | |
| dc.date | 2006-10-26 | |
| dc.date.accessioned | 2026-07-07T08:16:46Z | |
| dc.date.available | 2026-07-07T08:16:46Z | |
| dc.description | The sphere-packing bound $E_{sp}(R)$ bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To beat the bound, the problem must be changed. While it has long been known that variable-length block codes can do better when trading-off error probability with expected block-length, this correspondence shows that the {\em fixed-delay} setting also presents such an opportunity for generic channels. While $E_{sp}(R)$ continues to bound the tradeoff between bit error and fixed end-to-end latency for symmetric channels used {\em without} feedback, a new bound called the ``focusing bound'' gives the limits on what can be done with feedback. If low-rate reliable flow-control is free (ie. the noisy channel has strictly positive zero-error capacity), then the focusing bound can be asymptotically achieved. Even when the channel has no zero-error capacity, it is possible to substantially beat the sphere-packing bound by synthesizing an appropriately reliable channel to carry the flow-control information. | |
| dc.description | 9 pages, 3 figures, corrected typos and increased font size. Submitted to IT Transactions | |
| dc.identifier | https://arxiv.org/abs/cs/0610139 | |
| dc.identifier | http://arxiv.org/abs/cs/0610139 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133897 | |
| dc.subject | Information Theory | |
| dc.title | How to beat the sphere-packing bound with feedback | |
| dc.type | text |