By Topic

Error-correcting codes for list decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. Elias ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA

In the list-of-L decoding of a block code the receiver of a noisy sequence lists L possible transmitted messages, and is in error only if the correct message is not on the list. Consideration is given to (n,e,L) codes, which correct all sets of e or fewer errors in a block of n bits under list-of-L decoding. New geometric relations between the number of errors corrected under list-of-1 decoding and the (larger) number corrected under list-of-L decoding of the same code lead to new lower bounds on the maximum rate of (n,e,L) codes. They show that a jammer who can change a fixed fraction p<1/2 of the bits in an n-bit linear block code cannot prevent reliable communication at a positive rate using list-of- L decoding for sufficiently large n and an Ln. The new bounds are stronger for small n , but weaker for fixed e/n in the limit of large n and L than known random coding bounds

Published in:

IEEE Transactions on Information Theory  (Volume:37 ,  Issue: 1 )