Newton's identities for minimum codewords of a family of alternant codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1995

Newton's identities for minimum codewords of a family of alternant codes

Daniel Augot
  • Function : Author
  • PersonId : 833459

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
Fichier principal
Vignette du fichier
alternant-algsys.pdf (89.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00509424 , version 1 (12-08-2010)

Identifiers

Cite

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⟩

Collections

INRIA INSMI INRIA2
123 View
140 Download

Altmetric

Share

Gmail Facebook X LinkedIn More