E. Aguirre, A. Jarrah, and R. Laubenbacher, Generic ideals and Moreno-Soc??as conjucture, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.21-23, 2001.
DOI : 10.1145/384101.384105

M. Bardet, ´ Etude des systèmes algébriques surdéterminés. applications aux codes correcteurs etàet`età la cryptographie, 2004.

M. Bardet, J. Faugère, and B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving -ICPSS, pp.71-75, 2004.

A. Basiri and J. Faugère, Changing the ordering of Gröbner bases with LLL: case of two variables, Proceedings of ISSAC 2003, pp.23-29, 2003.

E. Becker, T. Mora, M. Marinari, and C. Traverso, The shape of the Shape Lemma, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.129-133, 1994.
DOI : 10.1145/190347.190382

T. Becker, V. Weispfenning, and H. Kredel, Gröbner Bases: a Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, 1993.

M. Bras-amorós and M. O-'sullivan, The Correction Capability of the Berlekamp???Massey???Sakata Algorithm with Majority Voting, Applicable Algebra in Engineering, Communication and Computing, vol.34, issue.5, part 2, pp.315-335, 2006.
DOI : 10.1007/s00200-006-0015-8

R. P. Brent, F. G. Gustavson, and D. Y. Yun, Fast solution of toeplitz systems of equations and computation of Pad?? approximants, Journal of Algorithms, vol.1, issue.3, pp.259-295, 1980.
DOI : 10.1016/0196-6774(80)90013-9

B. Buchberger, Gröbner bases: An algorithmic method in polynomial ideal theory, Multidimensional Systems Theory. Reidel, pp.184-232, 1985.

J. Buchmann, A. Pyshkin, and R. Weinmann, A Zero-Dimensional Gr??bner Basis for AES-128, Fast Software Encryption. LNCS, vol.4047, pp.78-88, 2006.
DOI : 10.1007/11799313_6

M. Cimpoeas, Generic initial ideal for complete intersections of embedding dimension three with strong lefschetz property, Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie, pp.33-66, 2007.

S. Collart, M. Kalkbrener, and D. Mall, Converting bases with the Gröbner walk, Journal of Symbolic Computation, vol.24, pp.3-4, 1997.

D. Cox, J. Little, and D. O-'shea, Using Algebraic Geometry, 1998.
DOI : 10.1007/978-1-4757-6911-1

X. Dahan, X. Jin, M. Moreno-maza, and E. Schost, Change of order for regular chains in positive dimension, Theoretical Computer Science, vol.392, issue.1-3, pp.37-65, 2008.
DOI : 10.1016/j.tcs.2007.10.003

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

J. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5 ), Proceedings of ISSAC 2002, pp.75-83, 2002.

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère and C. Mou, Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices, Proceedings of ISSAC 2011, pp.115-122, 2011.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology, Proceedings of ISSAC 2010, pp.257-264, 2010.

J. Faugre, M. Safey-el-din, and P. Spaenlehauer, Critical Points and Grbner Bases: the Unmixed Case, Proceedings of ISSAC 2012, pp.162-169, 2012.

G. Feng and T. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Transactions on Information Theory, vol.39, issue.1, pp.37-45, 1993.
DOI : 10.1109/18.179340

T. Høholdt, J. Van-lint, and R. Pellikaan, Algebraic Geometry Codes. Handbook of Coding Theory, 1998.

E. Jonckheere and C. Ma, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Linear Algebra and its Applications, vol.125, pp.65-76, 1989.
DOI : 10.1016/0024-3795(89)90032-3

D. Lazard, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer Algebra, EUROCAL' 83, pp.146-156, 1983.

D. Lazard, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992.
DOI : 10.1016/S0747-7171(08)80086-7

P. Loustaunau and E. 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

G. Moreno-socías, Autour de la fonction de Hilbert-Samuel (escaliers d'idéaux polynomiaux ), 1991.

G. Moreno-socías, Degrevlex Gr??bner bases of generic complete intersections, Journal of Pure and Applied Algebra, vol.180, issue.3, pp.263-283, 2003.
DOI : 10.1016/S0022-4049(02)00297-9

A. Morgan, Solving Polynominal Systems Using Continuation for Engineering and Scientific Problems, 1987.

K. Pardue, Generic sequences of polynomials, Journal of Algebra, vol.324, issue.4, pp.579-590, 2010.
DOI : 10.1016/j.jalgebra.2010.04.018

C. Pascal and E. Schost, Change of order for bivariate triangular sets, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.277-284, 2006.
DOI : 10.1145/1145768.1145814

F. Rouillier, Solving Zero-Dimensional Systems Through the Rational Univariate Representation, Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
DOI : 10.1007/s002000050114

URL : https://hal.archives-ouvertes.fr/inria-00073264

K. Saints and C. Heegard, Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases, IEEE Transactions on Information Theory, vol.41, issue.6, pp.1733-1751, 2002.
DOI : 10.1109/18.476246

S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, Journal of Symbolic Computation, vol.5, issue.3, pp.321-337, 1988.
DOI : 10.1016/S0747-7171(88)80033-6

S. Sakata, Extension of the Berlekamp-Massey algorithm to N dimensions, Information and Computation, vol.84, issue.2, pp.207-239, 1990.
DOI : 10.1016/0890-5401(90)90039-K

V. Zur-gathen, J. Gerhard, and J. , Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

D. Wang, Elimination Methods, 2001.
DOI : 10.1007/978-3-7091-6202-6

URL : https://hal.archives-ouvertes.fr/inria-00100616

D. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137