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
https://hal.inria.fr/inria-00509424 Contributor : Daniel AugotConnect in order to contact the contributor Submitted on : Thursday, August 12, 2010 - 11:42:24 AM Last modification on : Thursday, February 3, 2022 - 11:18:48 AM Long-term archiving on: : Saturday, November 13, 2010 - 2:35:59 AM
Daniel Augot. Newton's identities for minimum codewords of a family of alternant codes. 1995 IEEE International Symposium on Information Theory, Sep 1995, Whistler, Canada. pp.349, ⟨10.1109/ISIT.1995.550336⟩. ⟨inria-00509424⟩