Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels

Chintha Tellambura; Kaveh Mahdaviani; Masoud Ardakani; Shervin Shahidi; Shima Haddadi

arxiv: 1007.4371 · v1 · submitted 2010-07-26 · 💻 cs.IT · math.IT

Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels

Kaveh Mahdaviani , Shervin Shahidi , Shima Haddadi , Masoud Ardakani , Chintha Tellambura This is my paper

classification 💻 cs.IT math.IT

keywords boundbinarycodesgameobtainedsphere-packingchannelchannels

0 comments

read the original 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.

This paper has not been read by Pith yet.

Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels

discussion (0)