DocumentCode
929203
Title
Equivalent irreducible Goppa codes (Corresp.)
Author
Chen, Chin-long
Volume
24
Issue
6
fYear
1978
fDate
11/1/1978 12:00:00 AM
Firstpage
766
Lastpage
769
Abstract
Irreducible Goppa codes extended with an overall parity check are shown to be cyclic or shortened cyclic codes. The location points of a codeword of the extended irreducible codes can be designated as the points of a finite projective geometry. Bounds on the number of equivalence classes of both irreducible and extended irreducible Goppa codes are derived.
Keywords
Cyclic codes; Goppa codes; Equations; Galois fields; Geometry; Information theory; Parity check codes; Polynomials; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1978.1055951
Filename
1055951
Link To Document