DocumentCode :
1174747
Title :
Intersecting Goppa codes
Author :
Retter, Charles T.
Author_Institution :
Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
Volume :
35
Issue :
4
fYear :
1989
fDate :
7/1/1989 12:00:00 AM
Firstpage :
822
Lastpage :
828
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 presented
Keywords :
error correction codes; Goppa codes; intersecting codes; lower bounds; self-intersecting codes; Binary codes; Decoding; Error correction; Linear code; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.32158
Filename :
32158
Link To Document :
بازگشت