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

Authors:
Kaveh Mahdaviani;Shervin Shahidi;Shima Haddadi;Masoud Ardakani;Chintha Tellambura
Affiliations:
Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada;Department of Electrical and Computer Engineering, Queen's University, Kingston, ON, Canada;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 6
Cited 0

Solution of Ulam's problem on searching with a lie

Journal of Combinatorial Theory Series A
Ulam's searching game with a fixed number of lies

Theoretical Computer Science
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes

Discrete Mathematics
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Sphere-packing bounds revisited for moderate block lengths

IEEE Transactions on Information Theory
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.