Algebraic Solutions of Newton's identities for cyclic codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Algebraic Solutions of Newton's identities for cyclic codes

Daniel Augot
  • Function : Author
  • PersonId : 833459


This paper consider the use of Newton's identities for establishing properties of cyclic codes. The main tool is to consider these identities as equations, and to look for the properties of the solutions. First these equations have been considered as necessary conditions for establishing non existence properties of cyclic codes, such as the non existence of codewords of a given weight. The properties of these equations are studied, and the properties of the solution to the algebraic system are given. The main theorem is that codewords in a hamming sphere around a given word can be characterized by algebraic conditions. This theorem enables to describe the minimum codewords of a given cyclic codes, by algebraic conditions. The equations are solved using the Buchberger's algorithm for computing a Groebner basis. Examples are also given with alternant codes, and with a non linear code.
Fichier principal
Vignette du fichier
proceedings.pdf (63.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



Daniel Augot. Algebraic Solutions of Newton's identities for cyclic codes. 1998 Information Theory Workshop, Aug 1998, Killarney, Ireland. pp.49, ⟨10.1109/ITW.1998.706411⟩. ⟨inria-00509468⟩


142 View
131 Download



Gmail Facebook Twitter LinkedIn More