, Nonbinary BCH decoding (Abstr.), IEEE Transactions on Information Theory, vol.14, issue.2, pp.242-242, 1968.
DOI : 10.1109/TIT.1968.1054109
, Linear Algebra for Computing Grbner 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. Bath, United Kingdom, pp.61-68, 2015.
, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.7065
, Linear recurrences with constant coefficients: the multivariate case, Discrete Mathematics, vol.225, issue.1-3, pp.51-75, 2000.
DOI : 10.1016/S0012-365X(00)00147-3
, 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
, 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
, Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property, 2015.
DOI : 10.1007/978-3-319-32859-1_11
, IntroductionàIntroduction`Introductionà la résolution des systèmes polynomiaux, of Mathématiques et Applications, 2007.
, Spectral clustering properties of block multilevel Hankel matrices, Linear Algebra and its Applications, vol.306, issue.1-3, pp.155-163, 2000.
DOI : 10.1016/S0024-3795(99)00251-7
, 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
, 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.
, 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
, Algebraic solution of systems of polynomial equations using Gröbner bases, Proc. of AAECC-5, pp.247-257, 1989.
, 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
, 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
, 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
, 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
, On the matrix berlekamp-massey algorithm, ACM Transactions on Algorithms, vol.9, issue.4, pp.1-33, 2013.
DOI : 10.1145/2500122
, Creative Telescoping for Holonomic Functions Computer Algebra in Quantum Field Theory, pp.171-194, 2013.
, On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal, Proc. of the 22nd Annual ACM STOC, 1990.
, 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
, Modern algebra and polynomial ideals, Mathematical Proceedings of the Cambridge Philosophical Society, vol.30, issue.01, pp.27-46, 1934.
DOI : 10.1017/S0305004100012354
, 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
, 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
, Generalized arithmetical progressions and sumsets, Acta Mathematica Hungarica, vol.25, issue.4, pp.379-388, 1994.
DOI : 10.1007/BF01876039
, 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, 1995.
DOI : 10.1109/18.476246
, 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
, 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
, 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
, The BMS Algorithm, Gröbner Bases, Coding, and Cryptography, pp.143-163, 2009.
DOI : 10.1007/978-3-540-93806-4_9
, More Inequalities and Asymptotics for Matrix Valued Linear Positive Operators: the Noncommutative Case, Toeplitz Matrices and Singular Integral Equations, pp.293-315, 2002.
DOI : 10.1007/978-3-0348-8199-9_18
, Extrapolation, Interpolation, and Smoothing of Stationary Time Series, 1964.