Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels
Information Theory
2010-07-27 v1 math.IT
Abstract
A lower bound on the minimum required code length of binary codes is obtained. The bound is obtained based on observing a close relation between the Ulam's liar game and channel coding. In fact, Spencer's optimal solution to the game is used to derive this new bound which improves the famous Sphere-Packing Bound.
Keywords
Cite
@article{arxiv.1007.4371,
title = {Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels},
author = {Kaveh Mahdaviani and Shervin Shahidi and Shima Haddadi and Masoud Ardakani and Chintha Tellambura},
journal= {arXiv preprint arXiv:1007.4371},
year = {2010}
}
Comments
5 pages,3 figures, Presented at the Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Sep. 2009