Intersecting Goppa codes
- 1 July 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (4) , 822-828
- https://doi.org/10.1109/18.32158
Abstract
Bounds on the rates of intersecting Goppa codes are derived and compared with previous bounds on intersecting codes. Intersecting, self-intersecting, and highly intersecting Goppa codes are discussed in detail. It is shown that asymptotically good intersecting Goppa codes exist and lower bounds are given on their rates. Six theorems for Goppa codes are also presentedKeywords
This publication has 4 references indexed in Scilit:
- Linear intersecting codesDiscrete Mathematics, 1985
- Linear binary codes with intersection propertiesDiscrete Applied Mathematics, 1984
- Bounds on Goppa codes (Corresp.)IEEE Transactions on Information Theory, 1976
- Correcting burst and random errors with Goppa codes (Corresp.)IEEE Transactions on Information Theory, 1976