D. Boucher, W. Geiselmann, and F. Ulmer, Skew Cyclic Codes, AAECC (Applied Algebra in Engineering, Communication and Computing), vol.18, pp.379-389, 2007.

D. Boucher and F. Ulmer, Coding with skew polynomial rings, Journal of Symbolic Computation, vol.44, pp.1644-1656, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00454884

X. Caruso and J. L. Borgne, Fast multiplication for skew polynomials, p.2017
URL : https://hal.archives-ouvertes.fr/hal-01457808

P. Delsarte, Bilinear Forms over a Finite Field with Applications to Coding Theory, J. Combin. Theory, vol.25, pp.226-241, 1978.

U. Martinez-penas, Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring, J. Algebra, vol.504, pp.587-612, 2018.

U. Martinez-penas and F. Kschischang, Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes

E. Gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, vol.21, issue.1, pp.3-16, 1985.

S. Gao, A New Algorithm for Decoding Reed-Solomon Codes, Communications, Information and Network Security, pp.55-68

Z. Li, A subresultant theory for Ore polynomials and applications, proceedings ISSAC, 1998.

Ø. Ore, Theory of non-commutative polynomials, vol.34, pp.480-508, 1933.

S. Puchinger and A. Wachter-zeh, Sub-quadratic decoding of Gabidulin codes, IEEE Int. Symp. Inf. Theory (ISIT, 2016.

G. Robert, Codes de Gabidulin en caractéristique nulle : application au codage espace-temps, 2015.

R. Roth, Maximum-Rank Array Codes and their Application to Crisscross Error Correction, IEEE Trans. Inform. Theory, 1991.

A. Wachter-zeh, Decoding of block and convolutional codes in rank metric, 2013.
URL : https://hal.archives-ouvertes.fr/tel-01056746