In this paper, we present a new approach of the decoding of Gabidulin codes. We show that, in the same way as decoding Reed-Solomon codes is an instance of the problem called polynomial reconstruction, the decoding of Gabidulin codes can be seen as an instance of the problem of reconstruction of linearized polynomials. This approach leads to the design of two efficient decoding algorithms inspired from the Welch-Berlekamp decoding algorithm for Reed-Solomon codes. The first algorithm has the same complexity as the existing ones, that is cubic in the number of errors, whereas the second has quadratic complexity in 2.5n Ń  - 1.5k 2 .
['Pierre Loidreau']
A welch-berlekamp like algorithm for decoding gabidulin codes