Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 362-

  Augot, Daniel ^a,b   Bardet, Magali ^c   Faugère, Jean Charles ^c  

^a INRIA ROCQUENCOURT   (France)

^b INRIA   (France)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; BINARY CODES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CYCLIC CODES; GROBNER BASES;

DECODING;

EID: 0142008226     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228378     Document Type: Conference Paper

References (4)

1. D. Augot, Description of minimum weight codewords of cyclic codes by algebraic systems. Finite Fields Appl., vol. 2, pp. 138-152, 1996.
2. 4). J. Pure Appl. Algebra, 139(1-3):61-88, 1999.
3. P. Loustaunau and E. Von York. On the decoding of cyclic codes using Gröbner bases. Appl. Algebra Eng. Commun. Comput., 8(6):469-483, 1997.
4. I.S. Reed, T.K. Truong, X. Chen, and X. Yin. The algebraic decoding of the (41, 21, 9) quadratic residue code. IEEE Trans. Inform. Theory, 38(3):974-986, 1992.