Algebraic Solutions of Newton's identities for cyclic codes

Daniel Augot 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
Abstract : 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.
Type de document :
Communication dans un congrès
1998 Information Theory Workshop, Aug 1998, Killarney, Ireland. IEEE, pp.49, 1998, 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=706411〉. 〈10.1109/ITW.1998.706411〉
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00509468
Contributeur : Daniel Augot <>
Soumis le : jeudi 12 août 2010 - 15:52:34
Dernière modification le : vendredi 25 mai 2018 - 12:02:03
Document(s) archivé(s) le : samedi 13 novembre 2010 - 02:39:45

Fichiers

proceedings.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Daniel Augot. Algebraic Solutions of Newton's identities for cyclic codes. 1998 Information Theory Workshop, Aug 1998, Killarney, Ireland. IEEE, pp.49, 1998, 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=706411〉. 〈10.1109/ITW.1998.706411〉. 〈inria-00509468〉

Partager

Métriques

Consultations de la notice

342

Téléchargements de fichiers

130