List decoding algorithms for certain concatenated codes
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 181-190
- https://doi.org/10.1145/335305.335327
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Packings with large minimum kissing numbersDiscrete Mathematics, 1997
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut boundInventiones Mathematicae, 1995
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert boundMathematische Nachrichten, 1982
- Superimposed concatenated codes (Corresp.)IEEE Transactions on Information Theory, 1980
- A new class of asymptotically good codes beyond the Zyablov boundIEEE Transactions on Information Theory, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- 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
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966