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

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

2010-07-26

arxiv.org/abs/1007.4371v1

Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on , vol., no., pp.553-557, Sept.

Computer Science

Information Theory

5 pages,3 figures, Presented at the Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Sep. 20

Scientific paper

10.1109/ALLERTON.2009.5394906

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.

Affiliated with

Also associated with

No associations

Rating

Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558015