On fast decoding of interleaved Gabidulin codes
Vladimir R. Sidorenko, Antonia Wachter-Zeh, Di Chen · 2012
Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.