C. Banderier and P. Flajolet, Basic analytic combinatorics of directed lattice paths, Theoretical Computer Science, vol.281, issue.1-2, pp.37-80, 2002.
DOI : 10.1016/S0304-3975(02)00007-5

A. Benoit, F. Chyzak, A. Darrasse, S. Gerhold, M. Mezzarobba et al., The Dynamic Dictionary of Mathematical Functions (DDMF), Mathematical Software ? ICMS 2010, pp.35-41, 2010.
DOI : 10.1007/978-3-642-15582-6_7
URL : https://hal.archives-ouvertes.fr/hal-00783048

E. Berlekamp, Nonbinary BCH decoding (Abstr.), IEEE Transactions on Information Theory, vol.14, issue.2, pp.242-242, 1968.
DOI : 10.1109/TIT.1968.1054109

J. Berthomieu, B. Boyer, J. Faugère, and . Ch, Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, 40th International Symposium on Symbolic and Algebraic Computation. Proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, pp.61-68, 2015.

J. Berthomieu, B. Boyer, J. Faugère, and . Ch, Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, Journal of Symbolic Computation, p.48, 2016.

J. Berthomieu, J. Faugère, and . Ch, Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra, 41st International Symposium on Symbolic and Algebraic Computation, pp.95-102, 2016.
DOI : 10.1145/2930889.2930926
URL : https://hal.archives-ouvertes.fr/hal-01314266

S. R. Blackburn, Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences, IEEE Transactions on Information Theory, vol.43, issue.2, pp.537-548, 1997.
DOI : 10.1109/18.556111

R. Bose and D. Ray-chaudhuri, On a class of error correcting binary group codes, Information and Control, vol.3, issue.1, pp.68-79, 1960.
DOI : 10.1016/S0019-9958(60)90287-4

A. Bostan, M. Bousquet-mélou, M. Kauers, and S. Melczer, On 3-Dimensional Lattice Walks Confined to the Positive Octant, Annals of Combinatorics, vol.20, issue.2, 2014.
DOI : 10.1145/96877.96929
URL : https://hal.archives-ouvertes.fr/hal-01063886

M. Bousquet-mélou and M. Mishna, Walks with small steps in the quarter plane, In: Algorithmic probability and combinatorics. Contemp. Math. Amer. Math. Soc, vol.520, pp.1-39, 2010.
DOI : 10.1090/conm/520/10252

M. Bousquet-mélou and M. Petkov?ek, Walks confined in a quadrant are not always D-finite, random Generation of Combinatorial Objects and Bijective Combinatorics. URL http, pp.257-276, 2003.
DOI : 10.1016/S0304-3975(03)00219-6

J. Brachat, P. Comon, B. Mourrain, and E. P. Tsigaridas, Symmetric tensor decomposition, Linear Algebra and its Applications, vol.433, issue.11-12, pp.11-12, 2010.
DOI : 10.1016/j.laa.2010.06.046
URL : https://hal.archives-ouvertes.fr/inria-00355713

M. Bras-amorós and M. E. 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

D. Cox, J. Little, and D. O-'shea, Ideals, Varieties, and Algorithms, Undergraduate Texts in Mathematics, 2015.

D. A. Cox, J. Little, and D. O-'shea, Using Algebraic Geometry, Graduate Texts in Mathematics, vol.185, 2005.
DOI : 10.1007/978-1-4757-6911-1

N. S. Daleo and J. D. Hauenstein, Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property, Mathematical Aspects of Computer and Information Sciences: 6th International Conference, pp.137-142, 2015.
DOI : 10.1007/978-3-319-32859-1_11

J. Dornstetter, On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.), IEEE Transactions on Information Theory, vol.33, issue.3, pp.428-431, 1987.
DOI : 10.1109/TIT.1987.1057299

M. Elkadi and B. Mourrain, IntroductionàIntroduction`Introductionà la résolution des systèmes polynomiaux, of Mathématiques et Applications, 2007.

J. Erdös, On the structure of ordered real vector spaces, Publ. Math. Debrecen, vol.4, pp.334-343, 1956.

J. Faugère, . Ch, 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, . Ch, and C. Mou, Fast Algorithm for Change of Ordering of Zerodimensional Gröbner Bases with Sparse Multiplication Matrices, Proc. of the 36th ISSAC. ACM, pp.115-122, 2011.

J. Faugère, . Ch, and C. Mou, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, issue.3, pp.538-569, 2017.
DOI : 10.1016/j.jsc.2016.07.025

P. Fitzpatrick and G. Norton, Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence, IEEE Transactions on Information Theory, vol.36, issue.6, pp.1480-1487, 1990.
DOI : 10.1109/18.59953

D. Gorenstein, An arithmetic theory of adjoint plane curves, Transactions of the American Mathematical Society, vol.72, issue.3, pp.414-436, 1952.
DOI : 10.1090/S0002-9947-1952-0049591-8

V. Guisse, Algèbre linéaire dédiée pour les algorithmes Scalar-FGLM et Berlekamp-Massey-Sakata, 2017.

A. Hocquenghem, Codes correcteurs d'erreurs, pp.147-156, 1959.

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

E. Kaltofen and V. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.180-191, 1991.
DOI : 10.1145/113379.113396

E. Kaltofen and G. Yuhasz, A fraction free Matrix Berlekamp/Massey algorithm, Linear Algebra and its Applications, vol.439, issue.9, pp.2515-2526, 2013.
DOI : 10.1016/j.laa.2013.06.016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.4332

E. Kaltofen and G. Yuhasz, On the matrix berlekamp-massey algorithm, ACM Transactions on Algorithms, vol.9, issue.4, pp.1-33, 2013.
DOI : 10.1145/2500122
URL : http://www4.ncsu.edu/~kaltofen/bibliography/06/KaYu06.pdf

N. Levinson, The Wiener RMS (Root Mean Square) Error Criterion in Filter Design and Prediction, J. Math. Phys, vol.25, pp.261-278, 1947.
DOI : 10.1007/978-1-4612-5335-8_16

F. S. Macaulay, Modern algebra and polynomial ideals, Mathematical Proceedings of the Cambridge Philosophical Society, vol.30, issue.01, pp.27-46, 1934.
DOI : 10.1017/S0305004100012354

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

T. Mora, M. Sala, S. Sakata, T. Mora, C. Traverso et al., Gröbner technology, Gröbner Bases, Coding, and Cryptography, pp.11-25, 2009.

L. Robbiano, On the theory of graded structures, Journal of Symbolic Computation, vol.2, issue.2, pp.139-170, 1986.
DOI : 10.1016/S0747-7171(86)80019-0

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

S. Sakata, Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm, IEEE Transactions on Information Theory, vol.37, issue.4, pp.1200-1203, 1991.
DOI : 10.1109/18.86974

S. Sakata, M. Sala, S. Sakata, T. Mora, C. Traverso et al., The BMS Algorithm, Gröbner Bases, Coding, and Cryptography, pp.143-163, 2009.
DOI : 10.1007/978-3-540-93806-4_9

N. Wiener, Extrapolation, Interpolation, and Smoothing of Stationary Time Series, 1964.