C. Alves and J. Belfiore, Space-time codes based on quaternion algebras of small volume, 2012.

A. Alamouti, A simple transmit diversity technique for wireless communications. Selected Areas in Communications, IEEE Journal on, vol.16, issue.8, pp.1451-1458, 1998.

D. Augot, Generalization of Gabidulin codes over fields of rational functions, 21st International Symposium on Mathematical Theory of Networks and Systems, p.2014, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01094843

D. Boucher, W. Geiselmann, and F. Ulmer, Skew-cyclic codes. Applicable Algebra in Engineering, Communication and Computing, vol.18, issue.4, pp.379-389, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00023483

R. Chandra-bose, K. Dwijendra, and . Ray-chaudhuri, On a class of error correcting binary group codes, Information and Control, vol.3, issue.1, pp.68-79, 1960.
DOI : 10.1016/S0019-9958(60)90287-4

D. Boucher and F. Ulmer, 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

D. Boucher and F. Ulmer, Self-dual skew codes and factorization of skew polynomials, Journal of Symbolic Computation, vol.60, pp.47-61, 2014.
DOI : 10.1016/j.jsc.2013.10.003
URL : https://hal.archives-ouvertes.fr/hal-00719506

R. Elwyn, . Berlekamp, R. Lloyd, and . Welch, Error correction for algebraic block codes, US Patent, vol.4633, p.470, 1986.

X. Caruso and J. Le-borgne, Some algorithms for skew polynomials over finite fields. arXiv preprint, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00765577

L. Chaussade, Codes correcteurs sur des anneaux de öre multivariés, 2008.

L. Chaussade, Codes correcteurs avec les polynômes tordus, 2010.

L. Chaussade, P. Loidreau, and F. Ulmer, Skew codes of prescribed distance or rank. Designs, Codes and Cryptography, pp.267-284, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00267034

H. Cohen, A course in computational algebraic number theory, 1993.
DOI : 10.1007/978-3-662-02945-9

A. David and . Cox, Galois theory, 2011.

[. Delsarte, 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

S. Gao, A New Algorithm for Decoding Reed-Solomon Codes, Communications, Information and Network Security, pp.55-68, 2003.
DOI : 10.1007/978-1-4757-3789-9_5

P. Gemmell and M. Sudan, Highly resilient correctors for polynomials, Information Processing Letters, vol.43, issue.4, pp.169-174, 1992.
DOI : 10.1016/0020-0190(92)90195-2

W. Richard and . Hamming, Error detecting and error correcting codes, Bell System technical journal, vol.29, issue.2, pp.147-160, 1950.

T. Ho and D. Lun, Network coding : an introduction, 2008.
DOI : 10.1017/CBO9780511754623

C. Hollanti, J. Lahtonen, and H. Lu, Maximal orders in the design of dense space-time lattice codes. Information Theory, IEEE Transactions on, vol.54, issue.10, pp.4493-4510, 2008.

A. Hocquenghem, Codes correcteurs d'erreurs. Chiffres (paris), pp.147-156116, 1959.

[. Hassibi and H. Vikalo, On the sphere-decoding algorithm I. Expected complexity, IEEE Transactions on Signal Processing, vol.53, issue.8, pp.2806-2818, 2005.
DOI : 10.1109/TSP.2005.850352

R. Jurrius and R. Pellikaan, On defining generalized rank weights. arXiv preprint, 2015.

R. Koetter, R. Frank, and . Kschischang, Coding for errors and erasures in random network coding. Information Theory, IEEE Transactions on, vol.54, issue.8, pp.3579-3591, 2008.

R. Koetter and M. Médard, An algebraic approach to network coding, IEEE/ACM Transactions on Networking, vol.11, issue.5, pp.782-795, 2003.
DOI : 10.1109/TNET.2003.818197

[. Kuijper and A. Trautmann, List-decoding Gabidulin codes via interpolation and the euclidean algorithm, Information Theory and its Applications (ISITA), p.2014

[. Lu and P. Kumar, A unified construction of space-time codes with optimal ratediversity tradeoff. Information Theory, IEEE Transactions on, vol.51, issue.5, pp.1709-1730, 2005.

P. Loidreau, A Welch???Berlekamp Like Algorithm for Decoding Gabidulin Codes, Coding and Cryptography, pp.36-45, 2006.
DOI : 10.1007/11779360_4
URL : https://hal.archives-ouvertes.fr/hal-00459611

W. Li, V. Sidorenko, and D. Silva, On transform-domain error and erasure correction by Gabidulin codes. Designs, Codes and Cryptography, pp.571-586, 2014.

[. Neukirch, Algebraic number theory, 1999.
DOI : 10.1007/978-3-662-03983-0

F. Oggier, J. Belfiore, and E. Viterbo, Cyclic Division Algebras: A Tool for Space-Time Coding, Foundations and Trends?? in Communications and Information Theory, vol.4, issue.1, 2007.
DOI : 10.1561/0100000016

[. Oggier and A. Datta, Self-Repairing Codes for distributed storage — A projective geometric construction, 2011 IEEE Information Theory Workshop
DOI : 10.1109/ITW.2011.6089443

F. Oggier, G. Rekaya, J. Belfiore, and E. Viterbo, Perfect Space–Time Block Codes, IEEE Transactions on Information Theory, vol.52, issue.9, pp.3885-3902, 2006.
DOI : 10.1109/TIT.2006.880010

[. Oggier and A. Sboui, On the existence of generalized rank weights, 2012.

A. Poli and L. Huguet-i-rotger, Codes correcteurs : théorie et applications, 1989.

R. M. Roth, Maximum-rank array codes and their application to crisscross error correction. Information Theory, IEEE Transactions on, vol.37, issue.2, pp.328-336, 1991.

S. Irving, G. Reed, and . Solomon, Polynomial codes over certain finite fields, Journal of the society for industrial and applied mathematics, vol.8, issue.2, pp.300-304, 1960.

P. Samuel, Théorie algébrique des nombres, 1971.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

C. Richard and . Singleton, Maximum distance n-ary codes. Information Theory, IEEE Transactions on, vol.10, issue.2, pp.116-118, 1964.

D. Silva, R. Frank, R. Kschischang, and . Koetter, A rank-metric approach to error control in random network coding. Information Theory, IEEE Transactions on, vol.54, issue.9, pp.3951-3967, 2008.

[. Sethuraman, V. Sundar-rajan, and . Shashidhar, Full-diversity, high-rate space-time block codes from division algebras. Information Theory, IEEE Transactions on, issue.10, pp.492596-2616, 2003.

[. Stewart, Galois theory, 2015.
DOI : 10.1007/978-94-009-0839-0

H. Stichtenoth, Algebraic function fields and codes, 2009.

I. Telatar, Capacity of Multi-antenna Gaussian Channels, European transactions on telecommunications, pp.585-595, 1999.
DOI : 10.1002/ett.4460100604

V. Tarokh, N. Seshadri, and R. Calderbank, Space-time codes for high data rate wireless communication: performance criterion and code construction, IEEE Transactions on Information Theory, vol.44, issue.2, pp.744-765, 1998.
DOI : 10.1109/18.661517

V. Tarokh, N. Seshadri, and R. Calderbank, Space-time codes for high data rate wireless communication: performance criterion and code construction, IEEE Transactions on Information Theory, vol.44, issue.2, pp.744-765, 1998.
DOI : 10.1109/18.661517

A. Wachter, V. Afanassiev, and V. Sidorenko, Fast decoding of Gabidulin codes, WCC 2011-Workshop on coding and cryptography, pp.433-442, 2011.
DOI : 10.1007/s10623-012-9659-5
URL : https://hal.archives-ouvertes.fr/inria-00614474

R. Lloyd, . Welch, R. Elwyn, and . Berlekamp, Error correction for algebraic block codes, US Patent, vol.4633, p.470, 1986.

A. Wachter-zeh, Bounds on List Decoding of Rank-Metric Codes, IEEE Transactions on Information Theory, vol.59, issue.11, pp.7268-7277, 2013.
DOI : 10.1109/TIT.2013.2274653
URL : https://hal.archives-ouvertes.fr/hal-00904783

A. Wachter-zeh, Decoding of Block and Convolutional Codes in Rank Metric, 2013.
URL : https://hal.archives-ouvertes.fr/tel-01056746