An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

DOI10.1109/TIT.2008.920216zbMATH Open1323.94182arXivcs/0608042MaRDI QIDQ3604469FDOQ3604469

Gil Wiechman, Igal Sason

Publication date: 24 February 2009

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

Abstract: This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, as suggested by Valembois and Fossorier, is also discussed. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly tighter than the SP67 bound and its recent improved version. The ISP bound is applicable to symmetric memoryless channels, and some of its applications are exemplified. Its tightness is studied by comparing it with bounds on the ML decoding error probability, and computer simulations of iteratively decoded turbo-like codes. The paper also presents a technique which performs the entire calculation of the SP59 bound in the logarithmic domain, thus facilitating the exact calculation of this bound for moderate to large block lengths without the need for the asymptotic approximations provided by Shannon.

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

Recommendations

• Sphere-Packing Bounds Revisited for Moderate Block Lengths
• The sphere packing bound for memoryless channels
• Lower bound on error probability in fixed-volume list decoding
• Lower bound for ensemble-average error probability for a discrete memoryless channel
• Lower bounds to error probability for coding on discrete memoryless channels. I

Mathematics Subject Classification ID

Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Cited In (3)

• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Sphere-Packing Bounds Revisited for Moderate Block Lengths
• On the sphere-packing bound, capacity, and similar results for Poisson channels

This page was built for publication: An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604469)