,
,
,
,
,
,
,
, A uniform approach for the fast computation of matrix-type pade approximants, SIAM J. Matrix Anal. Appl, vol.15, pp.804-823, 1994.
, Nonbinary BCH decoding, IEEE Trans. Inform. Theory, vol.14, pp.242-242, 1968.
, Linear algebra for computing gröbner bases of linear recursive multidimensional sequences, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp.61-68, 2015.
, Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, Journal of Symbolic Computation, vol.83, pp.36-67, 2017.
, -depth comparison of the Berlekamp -Massey -Sakata and the Scalar-FGLM algorithms: the non adaptive variants, 2017.
, A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, pp.79-86, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01784369
, , 2020.
, Fast rational interpolation, reed-solomon decoding, and the linear complexity profiles of sequences, IEEE Transactions on Information Theory, vol.43, pp.537-548, 1997.
, On a class of error correcting binary group codes, Information and Control, vol.3, pp.90287-90291, 1960.
, The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, Communication and Computing, vol.17, pp.315-335, 2006.
, Fast solution of Toeplitz systems of equations and computation of Padé approximants, Journal of Algorithms, vol.1, pp.90013-90022, 1980.
, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.28, pp.693-701, 1991.
, An algorithm for the machine calculation of complex fourier series, Mathematics of Computation, vol.19, pp.297-301, 1965.
, Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, 2015.
, On the equivalence between Berlekamp's and Euclid's algorithms (corresp.), IEEE Transactions on Information Theory, vol.33, pp.428-431, 1987.
, Fast algorithm for change of ordering of zero-dimensional gröbner bases with sparse multiplication matrices, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pp.115-122, 2011.
, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, pp.538-569, 2017.
, A gröbner basis technique for padé approximation, J. Symbolic Comput, vol.13, pp.80087-80096, 1992.
, Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence, IEEE Trans. Inform. Theory, vol.36, pp.1480-1487, 1990.
, Codes correcteurs d'erreurs, vol.2, pp.147-156, 1959.
, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, AAECC, vol.30, pp.509-539, 2019.
, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Linear Algebra Appl, vol.125, pp.90032-90035, 1989.
, The Wiener RMS (Root-Mean-Square) error criterion in the filter design and prediction, J. Math. Phys, vol.25, pp.261-278, 1947.
, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory it, vol.15, pp.122-127, 1969.
, Fast algorithm for border bases of artinian gorenstein algebras, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp.333-340, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01515366
, Finding a minimal set of linear recurring relations capable of generating a given finite twodimensional array, J. Symbolic Comput, vol.5, pp.80033-80039, 1988.
, Extension of the Berlekamp-Massey algorithm to N Dimensions, Inform. and Comput, vol.84, p.90039, 1990.
, The bms algorithm, Gröbner Bases, Coding, and Cryptography, pp.143-163, 2009.
, Extrapolation, Interpolation, and Smoothing of Stationary Time Series, 1964.