Abstract : Space-time codes are error correcting codes dedicated to MIMO transmissions. Mathematically, a space-time code is a finite family of complex matrices. Its preformances rely on several parameters, including its minimal rank distance. Gabidulin codes are codes in this metric, famous for their optimality and thanks to efficient decoding algorithms. That's why they are used to design space-time codes. The main difficulty is to design complex matrices from binary matrices. The aim of the works collected here is to generalize Gabidulin codes to number fields, especially cyclique extesnions. We see that they have the same properties than Gabidulin codes over finite fields. We study several errors and erasures models and introduce a quadratic algorithm to recover transmitted information. When computing in finite fields, we are faced with the growing size problem. Indeed, the size of the coefficients grows exponentielly along the algorithm. To avoid this problem, it is possible to reduce the code, in order to compute in a finite field. Finally, we design a family of space-time codes, based on generalised Gabidulin codes. We see that our codes have performances similar to those of existing codes, and that they have additional structure.