On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity
Abstract
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.
Related
- The classical capacity of generalized amplitude-damping channels and its strong-converse exponent
- The exact strong converse exponent for private communication over quantum channels
- Strong converse for the quantum capacity of the pure-loss bosonic channel
- The critical exponent for the two-dimensional semilinear wave equation with strong damping
- Finite-Sample Binary Hypothesis Testing via Rényi Divergences: Strong Converse and Local Privacy
BibTeX
@misc{joudeh2026tightness,
title = {{On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity}},
author = {Hamdi Joudeh and Vincent Y. F. Tan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05791},
eprint = {2610.05791},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05791},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity
AU - Hamdi Joudeh
AU - Vincent Y. F. Tan
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.05791
UR - https://arxiv.org/abs/2610.05791
AB - 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.
ER -