Abstract : A decoding algorithm for Gabidulin codes (defined over Fqm) is shown that directly provides the evaluation polynomial using an equivalent of the Euclidean Algorithm. To obtain low complexity, a fast symbolic product and a fast symbolic division are presented. The achieved complexity of the whole decoding algorithm for Gabidulin codes is O(m3 log m) operations over the ground field Fq.
Type de document :
Communication dans un congrès
WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.433-442, 2011
https://hal.inria.fr/inria-00614474
Contributeur : Marie Trape
<>
Soumis le : jeudi 11 août 2011 - 15:56:43
Dernière modification le : mercredi 29 novembre 2017 - 10:26:43
Document(s) archivé(s) le : lundi 12 novembre 2012 - 15:18:46
Antonia Wachter, Valentin Afanassiev, Vladimir Sidorenko. Fast Decoding of Gabidulin Codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.433-442, 2011. 〈inria-00614474〉
