Some results on the problem of constructing asymptotically good error-correcting codes
- 1 July 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (4) , 412-417
- https://doi.org/10.1109/tit.1975.1055420
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(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 ofd/nfor low rates.Keywords
This publication has 5 references indexed in Scilit:
- A modification of the constructive asymptotically good codes of Justesen for low ratesInformation and Control, 1974
- Justesen's construction--The low-rate case (Corresp.)IEEE Transactions on Information Theory, 1973
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- Weight enumerator for second-order Reed-Muller codesIEEE Transactions on Information Theory, 1970
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952