Refined Strong Converse for the Constant Composition Codes

Abstract

A strong converse bound for constant composition codes of the form $P_e^{(n)}\ge 1-A{n}^{-0.5(1-E_{sc}^{\prime }(R,W,p))}{e}^{-n{E}_{sc}(R,W,p)}$ is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, where $A$ is a constant determined by the channel $W$, the composition $p$, and the rate $R$, i.e., $A$ does not depend on the block length $n$.

arXiv comment7 pages

References in corpus (15)

• Rényi Divergence and Kullback-Leibler Divergence
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Strong Converse to the Quantum Channel Coding Theorem
• On the quantum Renyi relative entropies and related capacity formulas
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• A strong converse for classical channel coding using entangled inputs
• Strong converse exponent for classical-quantum channel coding
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Strong converse rates for quantum communication
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• The Augustin Capacity and Center
• The Sphere Packing Bound via Augustin's Method
• Refined Strong Converse for the Constant Composition Codes
• A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses

Cited by in corpus (4)

• Non-Asymptotic Classical Data Compression with Quantum Side Information
• The Sphere Packing Bound For Memoryless Channels
• Refined Strong Converse for the Constant Composition Codes
• On the Existence of the Augustin Mean