Further results on Goppa codes and their applications to constructing efficient binary codes
- 1 September 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (5) , 518-526
- https://doi.org/10.1109/tit.1976.1055610
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A new class of binary codes constructed on the basis of BCH codes (Corresp.)IEEE Transactions on Information Theory, 1975
- Some efficient binary codes constructed using Srivastava codes (Corresp.)IEEE Transactions on Information Theory, 1975
- Decoding Goppa codes with a BCH decoder (Corresp.)IEEE Transactions on Information Theory, 1975
- Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)IEEE Transactions on Information Theory, 1973
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- A survey of constructive coding theory, and a table of binary codes of highest known rateDiscrete Mathematics, 1972
- Noncyclic generalizations of BCH and srivastava codesInformation and Control, 1972
- New binary codesIEEE Transactions on Information Theory, 1972
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- A class of optimum nonlinear double-error-correcting codesInformation and Control, 1968