| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777310 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(â3n(Ï+1)/2logâ¡(n)) decoding algorithm for â-Interleaved Gabidulin codes of length n, where Ï is the matrix multiplication exponent.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sven Puchinger, Sven Müelich, David Mödinger, Johan Rosenkilde né Nielsen, Martin Bossert,