The Sphere Packing Bound For Memoryless Channels

Abstract

Sphere packing bounds (SPBs) ---with prefactors that are polynomial in the block length--- are derived for codes on two families of memoryless channels using Augustin's method: (possibly non-stationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e. empirical distribution, type) of the input codewords. A variant of Gallager's bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.

arXiv comment29 pages

References in corpus (9)

• Rényi Divergence and Kullback-Leibler Divergence
• Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
• Saddlepoint Approximations for Short-Packet Wireless Communications
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• The Renyi 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
• The Augustin Center and The Sphere Packing Bound For Memoryless Channels

Cited by in corpus (3)

• Properties of Noncommutative Renyi and Augustin Information
• On the Existence of the Augustin Mean
• The Sphere Packing Bound for DSPCs with Feedback a la Augustin