Conference Proceedings

Improving the sphere-packing bound for binary codes over memoryless symmetric channels

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 (2009) 553-557
DOI: 10.1109/ALLERTON.2009.5394906
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. ©2009 IEEE.

Author supplied keywords

Cite

CITATION STYLE

APA

Mahdaviani, K., Shahidi, S., Haddadi, S., Ardakani, M., & Tellambura, C. (2009). Improving the sphere-packing bound for binary codes over memoryless symmetric channels. In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 (pp. 553–557). https://doi.org/10.1109/ALLERTON.2009.5394906

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free