On solutions of linear functional systems, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.1-6, 2001. ,
DOI : 10.1145/384101.384102
Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed???Solomon Codes, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2257-2265, 2005. ,
DOI : 10.1109/TIT.2005.850097
Fraction-free row reduction of matrices of Ore polynomials, Journal of Symbolic Computation, vol.41, issue.5, pp.513-543, 2006. ,
DOI : 10.1016/j.jsc.2005.10.002
Linear codes using skew polynomials with automorphisms and derivations. Designs, Codes and Cryptography, pp.405-431, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00597127
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, Advances in Mathematics of Communications, vol.9, issue.3, 2010. ,
DOI : 10.3934/amc.2015.9.311
Skew Field Constructions, 1977. ,
Bilinear forms over a finite field, with applications to coding theory, Journal of Combinatorial Theory, Series A, vol.25, issue.3, pp.226-241, 1978. ,
DOI : 10.1016/0097-3165(78)90015-8
Les d??terminants sur un corps non commutatif, Bulletin de la Société mathématique de France, vol.2, pp.27-45, 1943. ,
DOI : 10.24033/bsmf.1345
Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, vol.21, issue.1, pp.3-16, 1985. ,
Ideals over a Non-Commutative Ring and their Application in Cryptology, Eurocrypt, pp.482-489, 1991. ,
DOI : 10.1007/3-540-46416-6_41
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
Coding for Errors and Erasures in Random Network Coding, IEEE Transactions on Information Theory, vol.54, issue.8, pp.3579-3591, 2008. ,
DOI : 10.1109/TIT.2008.926449
List decoding of Reed???Solomon codes from a Gr??bner basis perspective, Journal of Symbolic Computation, vol.43, issue.9, pp.645-658, 2008. ,
DOI : 10.1016/j.jsc.2008.01.002
Factoring multivariate polynomials over finite fields, Journal of Computer and System Sciences, vol.30, issue.2, pp.235-246, 1985. ,
DOI : 10.1016/0022-0000(85)90016-9
On transform-domain error and erasure correction by Gabidulin codes. Designs, Codes and Cryptography, pp.571-586, 2014. ,
Decoding rank errors beyond the error correcting capability, Proc. of ACCT, pp.186-190, 2006. ,
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
Generalised Multi-sequence Shift-Register synthesis using module minimisation, 2013 IEEE International Symposium on Information Theory, pp.882-886, 2013. ,
DOI : 10.1109/ISIT.2013.6620353
Power decoding Reed?Solomon codes up to the Johnson radius, Proc. of ACCT, 2014. ,
Sub-Quadratic Decoding of One-Point Hermitian Codes, IEEE Transactions on Information Theory, vol.61, issue.6, 2014. ,
DOI : 10.1109/TIT.2015.2424415
URL : https://hal.archives-ouvertes.fr/hal-01245062
Theory of Non-Commutative Polynomials, The Annals of Mathematics, vol.34, issue.3, pp.480-508, 1933. ,
DOI : 10.2307/1968173
Maximum-rank array codes and their application to crisscross error correction, IEEE Transactions on Information Theory, vol.37, issue.2, pp.328-336, 1991. ,
DOI : 10.1109/18.75248
Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs, IEEE Transactions on Information Theory, vol.55, issue.7, pp.552991-3012, 2009. ,
DOI : 10.1109/TIT.2009.2021308
Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes, IEEE Transactions on Information Theory, vol.57, issue.2, pp.621-632, 2011. ,
DOI : 10.1109/TIT.2010.2096032
A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Transactions on Information Theory, vol.54, issue.9, pp.3951-3967, 2008. ,
DOI : 10.1109/TIT.2008.928291
Interpolation-based decoding of interleaved Gabidulin codes, Proc. of WCC, pp.528-538, 2013. ,
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