Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
List decodability at small radii
Chee Y., Ge G., Ji L., Ling S., Yin J. Designs, Codes and Cryptography61 (2):151-166,2011.Type:Article
Date Reviewed: Feb 2 2012

In many cases, it is impossible for a decoding algorithm to specify a unique codeword closest to a received word; list decoding refers to the technique of producing a short list of possible codewords. The key concept is (e,ℓ)-list decodability, which is when every Hamming ball of radius e contains at most ℓ codewords. The interest is in determining A’(n,d,e), that is, the smallest ℓ for which every binary code of length n and dimension d is (e,ℓ)-list decodable.

This paper determines A’(n,d,e) for all e < 4 (the “small radii” in the title) for all but 42 values of n. These 42 lacunae are due to unanswered questions about A(n,d,e), the maximum size of an (n,d,e) constant-weight code--that is, an (n,d) code, all of whose codewords have Hamming weight e.

The paper has comprehensive tables, but no new techniques are presented.

Reviewer:  J. Wolper Review #: CR139811 (1205-0500)
Bookmark and Share
 
Error Control Codes (E.4 ... )
 
 
Bounded-Action Devices (F.1.1 ... )
 
 
Data Encryption (E.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Error Control Codes": Date
Error coding cookbook
Rorabaugh C., McGraw-Hill, Inc., Hightstown, NJ, 1996. Type: Book (9780079117205)
Apr 1 1997
Trellis decoding of block codes
Honary B., Markarian G., Kluwer Academic Publishers, Norwell, MA, 1997. Type: Book (9780792398608)
Mar 1 1998
An enumeration of binary self-dual codes of length 32
Bilous R., Van Rees G. Designs, Codes and Cryptography 26(1/2/3): 61-86, 2002. Type: Article
Mar 6 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy