On the decoding of cyclic codes using Gröbner bases (Q1392662): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:11, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the decoding of cyclic codes using Gröbner bases |
scientific article |
Statements
On the decoding of cyclic codes using Gröbner bases (English)
0 references
3 June 1999
0 references
The authors revisit an algorithm due to Chen, Reed, Helleseth and Truong for decoding cyclic codes up to their true minimum distance using Gröbner basis techniques. They present an algorithm based on these ideas for decoding cyclic codes. They show how to compute a Gröbner basis for the syndrome ideal using an adaption of an algorithm of Faugére, Ginanni, Lazard and Mora. In this way they obtain a more efficient decoding algorithm. As an application of their algorithm the authors present the reduced Gröbner basis for the syndrome ideal of the [23,12,7] Golay code, and a decoding algorithm.
0 references
algorithm
0 references
decoding
0 references
cyclic codes
0 references
Gröbner basis
0 references
Golay code
0 references