A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels

DOI10.1109/TIT.2013.2276077zbMATH Open1364.94468DBLPjournals/tit/TomamichelT13arXiv1212.3689OpenAlexW3099057269WikidataQ60026405 ScholiaQ60026405MaRDI QIDQ5346239FDOQ5346239

Authors: Marco Tomamichel, Vincent Y. F. Tan 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n + O(1) if the epsilon-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for discrete memoryless channels with positive reverse dispersion. If the epsilon-dispersion vanishes, the logarithm of the epsilon-error capacity is upper bounded by the n times the capacity plus a constant term except for a small class of DMCs and epsilon >= 1/2.

Full work available at URL: https://arxiv.org/abs/1212.3689

Recommendations

• scientific article; zbMATH DE number 1204303
• Random coding bounds for discrete memoryless channels
• scientific article; zbMATH DE number 3973938
• scientific article; zbMATH DE number 3405822
• Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel
• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• Extremality Between Symmetric Capacity and Gallager’s Reliability Function $E_{0}$ for Ternary-Input Discrete Memoryless Channels
• scientific article; zbMATH DE number 4039789
• Lower bounds to error probability for coding on discrete memoryless channels. I
• scientific article; zbMATH DE number 4110621

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited In (4)

• Finite blocklength analysis of energy harvesting channels
• Moderate deviation analysis for classical communication over quantum channels
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• Fundamental finite key limits for one-way information reconciliation in quantum key distribution

This page was built for publication: A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346239)