Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm
  We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an $O(\ell^3 n^{(\omega+1)/2} \log(n))$ decoding algorithm for $\ell$-Interleaved Gabidulin codes of length $n$, where $\omega$ is the matrix multiplication exponent, improving in the exponent of $n$ compared to previous results. 
Sven Puchinger and Sven M\"uelich and David M\"odinger and Johan   Rosenkilde n\'e Nielsen and Martin Bossert
cs.IT cs.SC math.IT