Title :
Improving the Sphere-Packing Bound for binary codes over memoryless symmetric channels
Author :
Mahdaviani, Kaveh ; Shahidi, Shervin ; Haddadi, Shima ; Ardakani, Masoud ; Tellambura, Chintha
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada
fDate :
Sept. 30 2009-Oct. 2 2009
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 :
binary codes; channel coding; game theory; information theory; Spencer optimal solution; Ulam liar game; binary codes; channel coding; code length; memoryless symmetric channels; sphere-packing bound; AWGN channels; Binary codes; Block codes; Channel coding; Decoding; Error correction codes; Error probability; Gaussian channels; Memoryless systems; Upper bound; Maximum size of binary codes; Sphere-Packing Bound; Ulam´s liar game;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394906
