  In this work we will present algorithms for decoding rank metric codes. First
we will look at a new decoding algorithm for Gabidulin codes using the property
of Dickson matrices corresponding to linearized polynomials. We will be using a
Berlekamp-Massey-like algorithm in the process. We will show the difference
between our and existing algorithms. Apart from being a new algorithm, it is
also interesting that it can be modified to get a decoding algorithm for
general twisted Gabidulin codes.
