Fast decoding of Gabidulin codes - Université de Rennes Accéder directement au contenu
Article Dans Une Revue Designs, Codes and Cryptography Année : 2013

Fast decoding of Gabidulin codes

Résumé

Gabidulin codes are the analogues of Reed-Solomon codes in rank metric and play an important role in various applications. In this contribution, a method for efficient decoding of Gabidulin codes up to their error correcting capability is shown. The new decoding algorithm for Gabidulin codes (defined over ) directly provides the evaluation polynomial of the transmitted codeword. This approach can be seen as a Gao-like algorithm and uses an equivalent of the Euclidean Algorithm. In order to achieve low complexity, a fast symbolic product and a fast symbolic division are presented. The complexity of the whole decoding algorithm for Gabidulin codes is operations over the ground field F-q.

Dates et versions

hal-00785122 , version 1 (05-02-2013)

Identifiants

Citer

Antonia Wachter-Zeh, Valentin Afanassiev, Vladimir Sidorenko. Fast decoding of Gabidulin codes. Designs, Codes and Cryptography, 2013, 66 (3), pp.57-73. ⟨10.1007/s10623-012-9659-5⟩. ⟨hal-00785122⟩
197 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More