Refinement of the Sphere-Packing Bound: Asymmetric Channels

Abstract

We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the pre-factor in front of the exponential term. The order of our pre-factor is $\Omega (N^{-1/2(1+\epsilon +{\rho }_R^{\ast })})$ for any $\epsilon >0$, where ${\rho }_R^{\ast }$ is the maximum absolute-value subdifferential of the sphere-packing exponent at rate $R$ and $N$ is the blocklength.

Submitted to IEEE Trans. Inform. Theory

References in corpus (1)

• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding