C. Banderier and P. Flajolet, Basic analytic combinatorics of directed lattice paths, Theoret. Comput. Sci, vol.281, issue.1-2, pp.37-80, 2002.

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.
URL : https://hal.archives-ouvertes.fr/hal-00783048

E. Berlekamp, Nonbinary BCH decoding, IEEE Trans. Inform. Theory, vol.14, issue.2, pp.242-242, 1968.

J. Berthomieu, B. Boyer, and J. Faugère, 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, and J. Faugère, Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, Journal of Symbolic Computation, vol.83, pp.36-67, 2015.

J. Berthomieu and J. Faugère, 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.
URL : https://hal.archives-ouvertes.fr/hal-01314266

J. Berthomieu and J. Faugère, -depth comparison of the BerlekampMassey -Sakata and the Scalar-FGLM algorithms: the non adaptive variants, 2017.

J. Berthomieu and J. Faugère, A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations, ISSAC 2018 -43rd International Symposium on Symbolic and Algebraic Computation, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01784369

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.

A. Bostan, M. Bousquet-mélou, M. Kauers, and S. Melczer, On 3-dimensional lattice walks confined to the positive octant, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01063886

M. Bousquet-mélou and M. Mishna, Walks with small steps in the quarter plane, Algorithmic probability and combinatorics, vol.520, pp.1-39, 2010.

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, vol.307, pp.257-276, 2003.

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.17, issue.5, pp.315-335, 2006.

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

D. A. Cox, J. Little, and D. O'shea, Using Algebraic Geometry, Graduate Texts in Mathematics, vol.185, 2005.

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering, J. Symbolic Comput, vol.16, issue.4, pp.329-344, 1993.

J. Faugère and C. Mou, Fast Algorithm for Change of Ordering of Zerodimensional Gröbner Bases with Sparse Multiplication Matrices, Proc. of the 36th ISSAC, pp.115-122, 2011.

J. Faugère and C. Mou, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, issue.3, pp.538-569, 2017.

P. Fitzpatrick and G. Norton, Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence, IEEE Trans. Inform. Theory, vol.36, issue.6, pp.1480-1487, 1990.

V. Guisse, Algèbre linéaire dédiée pour les algorithmes scalar-fglm et Berlekamp-Massey-Sakata. Master's thesis, 2016.

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

E. Jonckheere and C. Ma, A simple Hankel interpretation of the BerlekampMassey algorithm, Linear Algebra Appl, vol.125, issue.0, pp.65-76, 1989.

E. Kaltofen and V. Pan, Processor efficient parallel solution of linear systems over an abstract field, SPAA '91, pp.180-191, 1991.

E. Kaltofen and G. Yuhasz, A fraction free Matrix Berlekamp/Massey algorithm, Linear Algebra Appl, vol.439, issue.9, pp.2515-2526, 2013.

E. Kaltofen and G. Yuhasz, On the Matrix Berlekamp-Massey Algorithm, ACM Trans. Algorithms, vol.9, issue.4, 2013.

K. Lee, Decoding of differential AG codes, Advances in Mathematics of Communications, vol.10, issue.2, pp.307-319, 2016.

N. Levinson, The Wiener RMS (Root-Mean-Square) error criterion in the filter design and prediction, J. Math. Phys, vol.25, pp.261-278, 1947.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory it, vol.15, pp.122-127, 1969.

A. Morgan, Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems, Society for Industrial and Applied Mathematics, 2009.

S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symbolic Comput, vol.5, issue.3, pp.321-337, 1988.

S. Sakata, Extension of the Berlekamp-Massey algorithm to N Dimensions, Inform. and Comput, vol.84, issue.2, pp.207-239, 1990.

S. Sakata, Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm, IEEE Trans. Inform. Theory, vol.37, issue.4, pp.1200-1203, 1991.

S. Sakata, M. Sala, S. Sakata, T. Mora, and C. Traverso, The BMS Algorithm, Gröbner Bases, Coding, and Cryptography, pp.143-163, 2009.

S. Sakata and M. Fujisawa, Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel-Pellikaan Bound, IEEE Transactions on Information Theory, vol.64, issue.6, pp.4452-4466, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01275736

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