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

A. Bostan, C. Jeannerod, and É. Schost, Solving toeplitz- and vandermonde-like linear systems with large displacement rank, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.33-40, 2007.
DOI : 10.1145/1277548.1277554

H. Chabanne and G. H. Norton, On the Key Equation for n-Dimensional Cyclic Codes, Proceedings. IEEE International Symposium on Information Theory, 1992.
DOI : 10.1109/ISIT.1993.748714
URL : https://hal.archives-ouvertes.fr/inria-00074879

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, Proc. of the 36th ISSAC, pp.115-122, 2011.

P. Gianni and T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases, Proc. of AAECC-5, pp.247-257, 1989.

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

E. Kaltofen and G. Yuhasz, On the matrix berlekamp-massey algorithm, ACM Transactions on Algorithms, vol.9, issue.4, pp.1-3324, 2013.
DOI : 10.1145/2500122

C. Koutschan, Creative Telescoping for Holonomic Functions, Computer Algebra in Quantum Field Theory, pp.171-194
DOI : 10.1007/978-3-7091-1616-6_7

Y. N. Lakshman, On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal, Proc. of the 22nd Annual ACM STOC, pp.555-563, 1990.

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

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

A. Poteaux and É. Schost, On the complexity of computing with zero-dimensional triangular sets, Journal of Symbolic Computation, vol.50, issue.0, pp.110-138, 2013.
DOI : 10.1016/j.jsc.2012.05.008
URL : https://hal.archives-ouvertes.fr/hal-00825847

I. Z. Ruzsa, Generalized arithmetical progressions and sumsets, Acta Mathematica Hungarica, vol.25, issue.4, pp.379-388, 1994.
DOI : 10.1007/BF01876039

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.411733-1751, 1995.
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

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, T. Mora, L. Perret, S. Sakata 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, 1949.