D. Augot, M. Bardet, and J. Faugère, 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.362-362, 2003.

D. Augot, P. Charpin, and N. Sendrier, Studying the locator polynomials of minimum weight codewords of BCH codes, IEEE Transactions on Information Theory, vol.38, issue.3, pp.960-973, 1992.
DOI : 10.1109/18.135638
URL : https://hal.archives-ouvertes.fr/hal-00723733

M. Bardet, ´ Etude des systèmes algébriques surdeterminés. Applications aux codes correcteurs etàetà la cryptographie, 2004.

M. Bardet, J. Faugère, B. , and S. , On the complexity of gröbner basis computation of semi-regular overdetermined algebraic equations, ICPSS Paris, pp.71-75, 2004.

M. Bardet, J. C. Faugère, and B. Salvy, Asymptotic expansion of the degree of regularity for semi-regular systems of equations, Mega 2005 Sardinia (Italy). 15 pages, 2005.

A. Barg, Complexity issues in coding theory, Handbook of Coding Theory, pp.649-754, 1998.

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

B. Buchberger, Ein algorithmisches Kriterium f??r die L??sbarkeit eines algebraischen Gleichungssystems, Aequationes Mathematicae, vol.95, issue.3, pp.374-383, 1970.
DOI : 10.1007/BF01844169

B. Buchberger, A theoretical basis for the reduction of polynomials to canonical forms, ACM SIGSAM Bulletin, vol.10, issue.3, pp.19-29, 1976.
DOI : 10.1145/1088216.1088219

B. Buchberger, A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner Basis, Proc. EUROSAM 79 of Lect. Notes in Comp. Sci, pp.3-21, 1979.

B. Buchberger, Gröbner Bases : an Algorithmic Method in Polynomial Ideal Theory Recent trends in multidimensional system theory, pp.184-232, 1985.

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

A. Canteaut and F. Chabaud, A new algorithm for finding minimumweight words in a linear code: application to mceliece's cryptosystem and to narrow-sense bch codes of length 511. Information Theory, IEEE Transactions on, vol.44, issue.1, pp.367-378, 1998.

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.519, pp.15-1463, 2003.

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

X. Chen, I. S. Reed, T. Helleseth, and T. K. Truong, Use of Grobner bases to decode binary cyclic codes up to the true minimum distance, IEEE Transactions on Information Theory, vol.40, issue.5, pp.1654-1661, 1994.
DOI : 10.1109/18.333885

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

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

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

I. Cooper and A. B. , A One-step Algorithm For Finding BCH Error Locator Polynomials, Proceedings. 1991 IEEE International Symposium on Information Theory, pp.2090-2091, 1991.
DOI : 10.1109/ISIT.1991.695149

I. Cooper and A. B. , A One-step Algorithm For Finding BCH Error Locator Polynomials, Proceedings. 1991 IEEE International Symposium on Information Theory, pp.93-93, 1991.
DOI : 10.1109/ISIT.1991.695149

D. Cox, J. Littel, and D. O-'shea, Ideals, Varieties and Algorithms, 1992.

M. De-boer and R. Pellikaan, Gröbner bases for codes, Some tapas in computer algebra. No. 4 in Algorithms and Computation in Mathematics, pp.237-259, 1999.

M. De-boer and R. Pellikaan, Gröbner bases for decoding, Some tapas in computer algebra. No. 4 in Algorithms and Computation in Mathematics, pp.260-275, 1999.

D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, of Graduate Texts in Mathematics, 1995.

J. C. Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, pp.1-3, 1999.

J. C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero F5, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp.75-83, 2002.

P. Gianni, Properties of Gr??bner bases under specializations, Eurocal '87: European Conference on Computer Algebra, pp.293-297, 1989.
DOI : 10.1007/3-540-51517-8_128

M. Grassl, On the minimum distance of some quadratic-residue codes, IEEE International Symposium on Information Theory (ISIT), 2000.

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.

M. Kalkbrener, Solving systems of algebraic equations by using gröbner bases, Lecture Notes in Computer Science, vol.87, issue.378, pp.282-292, 1987.

R. Lidl and H. Niederreiter, Finite Fields. Encyclopedia of Mathematics and its Applications, 1996.

P. Loustaunau and E. V. York, On the Decoding of Cyclic Codes Using Gr??bner Bases, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.6, pp.469-483, 1997.
DOI : 10.1007/s002000050084

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

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

E. Orsini and M. Sala, Correcting errors and erasures via the syndrome variety, Journal of Pure and Applied Algebra, vol.200, issue.1-2, pp.191-226, 2005.
DOI : 10.1016/j.jpaa.2004.12.027

E. Orsini and M. Sala, General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>, IEEE Transactions on Information Theory, vol.53, issue.3, pp.1095-1107, 2007.
DOI : 10.1109/TIT.2006.889465

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

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, ) golay code. Computers and Digital Techniques, pp.202-206, 1990.
DOI : 10.1002/0471684228.egp03172

C. Tjhai, M. Tomlinson, M. Grassl, R. Horan, M. Ahmed et al., New linear codes derived from binary cyclic codes of length 151, IEE Proceedings - Communications, vol.153, issue.5, pp.581-585, 2006.
DOI : 10.1049/ip-com:20050560

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. Valibouze, Modules de cauchy, polynômes caractéristiques et résolvantes, 1995.