Newton's identities for minimum codewords of a family of alternant codes
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
Origin : Files produced by the author(s)
Loading...