By Topic

Some results on the problem of constructing asymptotically good error-correcting codes

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
$31 $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)

Justesen has shown that concatenating a class of binary codes with a Reed-Solomon (RS) code produces asymptotically good codes. For low rates, the value of the ratio of minimum distance to code length (d/n) for such codes is substantially lower than that known to be achievable by the Zyablov bound. In this paper, we present a small class of binary codes with some useful properties. This class is then used in Justesen's construction to produce codes that have relatively large values of d/n for low rates.

Published in:

Information Theory, IEEE Transactions on  (Volume:21 ,  Issue: 4 )