]. F. Voloch, Asymptotics of the minimal distance of quadratic residue codes, 2004.

I. S. Reed, X. Yin, and T. Truong, Algebraic decoding of the (32, 16, 8) quadratic residue code, IEEE Transactions on Information Theory, vol.36, issue.4, pp.876-880, 1990.
DOI : 10.1109/18.53750

I. S. Reed, X. Yin, T. Truong, and J. K. Holmes, Decoding the (24,12,8) Golay code, IEE Proceedings E Computers and Digital Techniques, vol.137, issue.3, pp.202-206, 1990.
DOI : 10.1049/ip-e.1990.0025

I. S. Reed, T. Truong, X. Chen, and X. Yin, The algebraic decoding of the (41, 21, 9) quadratic residue code, IEEE Transactions on Information Theory, vol.38, issue.3, pp.974-986, 1992.
DOI : 10.1109/18.135639

X. Chen, I. S. Reed, and T. Truong, Decoding the (73, 37, 13) quadratic residue code, IEE Proceedings - Computers and Digital Techniques, vol.141, issue.5, pp.253-258, 1994.
DOI : 10.1049/ip-cdt:19941294

E. H. Lu, H. P. Wuu, Y. C. Cheng, and P. C. Lu, Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability, International Journal of Systems Science, vol.37, issue.4, pp.937-945, 1995.
DOI : 10.1109/18.54893

R. He, I. S. Reed, T. Truong, and X. Chen, Decoding the (47,24,11) quadratic residue code, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1181-1186, 2001.

Y. Chang, T. Truong, I. S. Reed, H. Y. Cheng, and C. D. Lee, Algebraic decoding of (71) quadratic residue codes, IEEE Transactions on Communications, vol.3679, issue.51 9, pp.1463-1473, 2003.

T. Truong, Y. Chang, Y. Chen, and C. D. Lee, Algebraic Decoding of (103, 52, 19) and (113, 57, 15) Quadratic Residue Codes, IEEE Transactions on Communications, vol.53, issue.5, pp.749-754, 2005.
DOI : 10.1109/TCOMM.2005.847147

A. B. Cooper and I. , Direct solution of bch syndrome equations, Communications , Control, and Signal Processing, pp.281-286, 1990.

P. Loustaunau and E. V. York, On the decoding of cyclic codes using Gröbner bases Applicable Algebra in Engineering, Communication and Computation, vol.8, issue.6, pp.469-483, 1997.

M. Caboara and T. Mora, The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gr??bner Shape Theorem, Applicable Algebra in Engineering, Communication and Computing, vol.13, issue.3, pp.209-232, 2002.
DOI : 10.1007/s002000200097

X. Chen, I. S. Reed, T. Helleseth, and T. K. Truong, General principles for the algebraic decoding of cyclic codes, IEEE Transactions on Information Theory, vol.40, issue.5, pp.1661-1663, 1994.
DOI : 10.1109/18.333886

?. , G. Bases-for-decoding, M. Ser-augot, J. Bardet, and . Faugère, Algorithms and Computation in Mathematics Available: http://www.win.tue Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases, Proceedings of the 2003 IEEE International Symposium on Information Theory, pp.260-275, 1999.

R. T. Chien, Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes, IEEE Transactions on Information Theory, vol.10, issue.4, pp.357-363, 1964.
DOI : 10.1109/TIT.1964.1053699

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, ser. North-Holland Mathematical Library, 1983.

D. Cox, J. Littel, and D. Shea, Ideals, Varieties and Algorithms, 1992.

D. Augot, Description of Minimum Weight Codewords of Cyclic Codes by Algebraic Systems, Finite Fields and Their Applications, vol.2, issue.2, pp.138-152, 1996.
DOI : 10.1006/ffta.1996.0009
URL : https://hal.archives-ouvertes.fr/hal-00723500

D. A. Cox, J. Little, and D. Shea, Using Algebraic Geometry, ser. Graduate Texts in Mathematics, 2005.