DocumentCode :
923735
Title :
Some results on the problem of constructing asymptotically good error-correcting codes
Author :
Weldon, E.J., Jr.
Volume :
21
Issue :
4
fYear :
1975
fDate :
7/1/1975 12:00:00 AM
Firstpage :
412
Lastpage :
417
Abstract :
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 
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 
for low rates.
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 for low rates.Keywords :
Concatenated codes; Error-correcting codes; Binary codes; Error correction codes; Helium; Interleaved codes; Reed-Solomon codes; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055420
Filename :
1055420
Link To Document :
