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

DOI10.1109/TIT.2008.920216zbMath1323.94182arXivcs/0608042MaRDI QIDQ3604469

Gil Wiechman, Igal Sason

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

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

Related Items (1)

A simple derivation of the refined sphere packing bound under certain symmetry hypotheses

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