Title :
Newton´s identities for minimum codewords of a family of alternant codes
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., France
Abstract :
We are able to define minimum weight codewords of some alternant codes in terms of solutions to algebraic equations. Particular attention is given to the case of the classical Goppa codes. Grobner bases are used to solve the system of algebraic equations
Keywords :
Goppa codes; Newton method; algebra; cyclic codes; Grobner bases; Newton´s identities; algebraic equations; alternant codes; classical Goppa codes; cyclic code; minimum weight codewords; Equations; Fourier transforms; Polynomials; Reed-Solomon codes;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550336
