On formulas for decoding binary cyclic codes
<|reference_start|>On formulas for decoding binary cyclic codes: We adress the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to find the error locator polynomial in terms of the syndroms of the received word. This is usually done with the Berlekamp-Massey algorithm in the case of BCH codes and related codes, but for the general case, there is no generic algorithm to decode cyclic codes. Even in the case of the quadratic residue codes, which are good codes with a very strong algebraic structure, there is no available general decoding algorithm. For this particular case of quadratic residue codes, several authors have worked out, by hand, formulas for the coefficients of the locator polynomial in terms of the syndroms, using the Newton identities. This work has to be done for each particular quadratic residue code, and is more and more difficult as the length is growing. Furthermore, it is error-prone. We propose to automate these computations, using elimination theory and Grbner bases. We prove that, by computing appropriate Grbner bases, one automatically recovers formulas for the coefficients of the locator polynomial, in terms of the syndroms.<|reference_end|>
@article{augot2007on,
    title={On formulas for decoding binary cyclic codes},
    author={Daniel Augot, Magali Bardet (LITIS), Jean-Charles Faug`ere (LIP6)},
    journal={IEEE International Symposium on Information Theory, 2007 (ISIT
  2007) (2007) 2646-2650},
    year={2007},
    doi={10.1109/ISIT.2007.4557618},
    archivePrefix={arXiv},
    eprint={cs/0701070},
    primaryClass={cs.IT math.IT}
}