A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994. ,
DOI : 10.1137/S0895479892230031
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.1, pp.114-144, 2000. ,
DOI : 10.1137/S0895479897326912
Normal forms for general polynomial matrices, Journal of Symbolic Computation, vol.41, issue.6, pp.708-737, 2006. ,
DOI : 10.1016/j.jsc.2006.02.001
Key equations for list decoding of Reed???Solomon codes and how to solve them, Journal of Symbolic Computation, vol.45, issue.7, pp.773-786, 2010. ,
DOI : 10.1016/j.jsc.2010.03.010
Solving structured linear systems with large displacement rank, Theoretical Computer Science, vol.407, issue.1-3, pp.155-181, 2008. ,
DOI : 10.1016/j.tcs.2008.05.014
Interpolation and List Decoding of Algebraic Codes, 2010. ,
Multivariate List Decoding of Evaluation Codes with a Gröbner Basis Perspective, 2008. ,
On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991. ,
DOI : 10.1007/BF01178683
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations, IEEE Transactions on Information Theory, vol.61, issue.5, pp.612370-2387, 2015. ,
DOI : 10.1109/TIT.2015.2416068
URL : https://hal.archives-ouvertes.fr/hal-00941435
Approximate common divisors via lattices, Tenth Algorithmic Number Theory Symposium, pp.271-293 ,
DOI : 10.2140/obs.2013.1.271
Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990. ,
DOI : 10.1145/28395.28396
Optimally robust private information retrieval, USENIX Security 12, pp.269-283 ,
Modern Computer Algebra (third edition), 2013. ,
On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003. ,
DOI : 10.1145/860854.860889
Computing hermite forms of polynomial matrices, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.155-162, 2011. ,
DOI : 10.1145/1993886.1993913
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy, IEEE Transactions on Information Theory, vol.54, issue.1, pp.135-150, 2008. ,
DOI : 10.1109/TIT.2007.911222
Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999. ,
DOI : 10.1109/18.782097
Computing minimal interpolation bases. HAL Open archive -https, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01241781
Linear Systems, 1980. ,
The analysis of algorithms, In Congrès int. Math, vol.3, pp.269-274, 1970. ,
Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory, vol.49, issue.11, pp.2809-2825, 2003. ,
DOI : 10.1109/TIT.2003.819332
Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014. ,
DOI : 10.1145/2608628.2608664
Fast computation of GCDs, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.142-151, 1973. ,
DOI : 10.1145/800125.804045
On lattice reduction for polynomial matrices, Journal of Symbolic Computation, vol.35, issue.4, pp.377-401, 2003. ,
DOI : 10.1016/S0747-7171(02)00139-6
A displacement approach to efficient decoding of algebraic-geometric codes, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.235-244, 1999. ,
DOI : 10.1145/301250.301311
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.285-294, 2005. ,
DOI : 10.1109/SFCS.2005.29
Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Information Theory, vol.46, issue.1, pp.246-257, 2000. ,
DOI : 10.1109/18.817522
Normalization of row reduced matrices, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.297-304, 2011. ,
DOI : 10.1145/1993886.1993931
Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, pp.139-144, 1971. ,
DOI : 10.1007/BF00289520
Notes on computing minimal approximant bases, Dagstuhl Seminar Proceedings, 2006. ,
A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992. ,
An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations, IEEE Transactions on Information Theory, vol.57, issue.9, pp.5946-5959, 2011. ,
DOI : 10.1109/TIT.2011.2162160
Fast Order Basis and Kernel Basis Computation and Related Problems, 2012. ,
Efficient algorithms for order basis computation, Journal of Symbolic Computation, vol.47, issue.7, pp.793-819, 2012. ,
DOI : 10.1016/j.jsc.2011.12.009