On the decoding of cyclic codes using Gröbner bases (Q1392662): Difference between revisions

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.