A. Wachter-Zeh

  • Citations Per Year
Learn More
Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over F<sub>q</sub>m 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(More)
  • 1