Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

04/20/2016

∙

by   Sven Puchinger, et al.

∙

0

∙

share

We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ^3 n^(ω+1)/2(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent, improving in the exponent of n compared to previous results.