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

DOI10.1109/TIT.2013.2276077zbMath1364.94468arXiv1212.3689OpenAlexW3099057269WikidataQ60026405 ScholiaQ60026405MaRDI QIDQ5346239

Marco Tomamichel, Vincent Y. F. Tan

Publication date: 8 June 2017

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

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

Mathematics Subject Classification ID

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

Related Items (4)

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

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