Metraipolis › archive › dc_749e998ffeb9
On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity — arXiv:2610.05791
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.05791
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:59:19.019Z
- SHA-256 of the archived text
177a9e1dbed45c5d4e1253c2059853612b0b93988faee64e02aed7319b083028- Stable URL of this page
https://metraipolis.com/documento/dc_749e998ffeb9
How to cite
On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity — arXiv:2610.05791 — arXiv (en), https://arxiv.org/abs/2610.05791 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_749e998ffeb9 (Metraipolis archive dc_749e998ffeb9, sha256 177a9e1dbed45c5d4e1253c2059853612b0b93988faee64e02aed7319b083028)
BibTeX
@misc{dc749e998ffeb9,
title = {On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity — arXiv:2610.05791},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.05791},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_749e998ffeb9; sha256 177a9e1dbed45c5d4e1253c2059853612b0b93988faee64e02aed7319b083028},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05791. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Omura's lower bound on the probability of correct decoding at rates above capacity has an exponent of sphere packing form. Dueck and Körner refined Omura's argument through a codebook extension step and obtained the exact strong converse exponent. It has been claimed in the literature that the two exponents coincide at all rates, but the argument contains an error. To settle this question, we first show that above a threshold rate, the strong converse exponent follows a straight line of unit slope determined by the Rényi capacity of order infinity. This threshold rate plays the role of a critical rate above capacity, while the order-infinity capacity plays that of a cutoff rate. We then show that the two exponents coincide up to a second threshold rate, which lies above the first, and differ strictly beyond it. Examples include modulo-additive channels, where there is no gap; and the binary erasure channel, where the thresholds and the gap are computed in closed form. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2610.05791 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T15:24:20.173Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).