Title :
Equivalent irreducible Goppa codes (Corresp.)
fDate :
11/1/1978 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1978.1055951