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

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.

published version

References in corpus (1)

• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks

Cited by in corpus (20)

• $f$-divergence Inequalities
• The Third-Order Term in the Normal Approximation for the AWGN Channel
• Fast HARQ over Finite Blocklength Codes: A Technique for Low-Latency Reliable Communication
• Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• Second-Order Coding Rates for Channels with State
• Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
• Moderate deviation analysis for classical communication over quantum channels
• Algorithmic Aspects of Optimal Channel Coding
• The Sphere Packing Bound via Augustin's Method
• Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information
• Channel Simulation: Finite Blocklengths and Broadcast Channels
• Finite-Block-Length Analysis in Classical and Quantum Information Theory
• Fixed Error Asymptotics For Erasure and List Decoding
• Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel
• Comments on "Channel Coding Rate in the Finite Blocklength Regime": On the Quadratic Decaying Property of the Information Rate Function
• First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture
• Continuous-Variable Quantum Key Distribution with Composable Security and Tight Error Correction Bound towards Constrained-Device Implementations
• Channels with cost constraints: strong converse and dispersion
• The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions