Erasure Decoding for Gabidulin Codes |
| |
Authors: | Regis F. Babindamana Cheikh Thiecoumba Gueye |
| |
Affiliation: | 1. Departement de Math??matiques Informatique, Facult?? des Sciences et Techniques, Universite Cheikh Anta Diop, Dakar, S??n??gal
|
| |
Abstract: | We present a new approach of the decoding algorithm for Gabidulin Codes. In the same way as efficient erasure decoding for Generalized Reed Solomon codes by using the structure of the inverse of the VanderMonde matrices, we show that, the erasure(t erasures mean that t components of a code vector are erased) decoding Gabidulin code can be seen as a computation of three matrice and an affine permutation, instead of computing an inverse from the generator or parity check matrix. This significantly reduces the decoding complexity compared to others algorithms. For t erasures with t ≤ r, where r = n − k, the erasure algorithm decoding for Gab n, k (g) Gabidulin code compute the t symbols by simple multiplication of three matrices. That requires rt + r(k − 1) Galois field multiplications, t(r − 1) + (t + r)k field additions, r 2 + r(k + 1) field negations and t(k + 1) field inversions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|