Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases

Abstract

This paper revisits the topic of decoding cyclic codes with Grobner bases. We introduce. new algebraic systems, for which the Grobner basis com- putation is easier. We show that formal decoding for- mulas are too huge to be useful, and that the most ef- ficient technique seems to be to recompute a Grobner basis for each word (online decoding). We use new Grobner basis algorithms and “trace preprocessing” to gain in efficiency.
Fichier principal
Vignette du fichier
AugotBardetFaugere.pdf (135.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00509269 , version 1 (11-08-2010)

Identifiers

Cite

Daniel Augot, Magali Bardet, Jean-Charles Faugère. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases. IEEE International Symposium on Information Theory - ISIT'2003, Jun 2003, Yokohama, Japan. pp.362 - 362, ⟨10.1109/ISIT.2003.1228378⟩. ⟨inria-00509269⟩
783 View
194 Download

Altmetric

Share

Gmail Facebook X LinkedIn More