Sphere-Packing Bounds Revisited for Moderate Block Lengths

DOI10.1109/TIT.2004.838090zbMATH Open1318.94122OpenAlexW2110372787MaRDI QIDQ3547743FDOQ3547743

Authors: Antoine Valembois, Marc Fossorier 

Publication date: 21 December 2008

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

Full work available at URL: https://doi.org/10.1109/tit.2004.838090

Recommendations

• An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
• The sphere packing bound for memoryless channels
• Sphere-bound-achieving coset codes and multilevel coset codes
• Constructive spherical codes near the Shannon bound
• 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 (5)

• The sphere packing bound for memoryless channels
• Title not available (Why is that?)
• An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• An efficient solution space exploring and descent method for packing equal spheres in a sphere

This page was built for publication: Sphere-Packing Bounds Revisited for Moderate Block Lengths

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