2016/04/20 by Puchinger, Sven, Müelich, Sven, Mödinger, David +2
#FOS: Computer and information sciences #Information Theory (cs.IT) #Symbolic Computation (cs.SC)
paper · doi:10.48550/arxiv.1604.05899
We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3 n(ω+1)/2 log(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.