Newton's identities for minimum codewords of a family of alternant codes
Augot, Daniel
HAL, inria-00509424 / Harvested from HAL
Text on HAL
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
Publié le : 1995-09-17
Classification:  ACM: E.: Data/E.4: CODING AND INFORMATION THEORY,  [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT],  [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 
@article{inria-00509424,
     author = {Augot, Daniel},
     title = {Newton's identities for minimum codewords of a family of alternant codes},
     journal = {HAL},
     volume = {1995},
     number = {0},
     year = {1995},
     language = {en},
     url = {http://dml.mathdoc.fr/item/inria-00509424}
}

Augot, Daniel. Newton's identities for minimum codewords of a family of alternant codes. HAL, Tome 1995 (1995) no. 0, . http://gdmltest.u-ga.fr/item/inria-00509424/