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.
https://hal.inria.fr/inria-00614474 Contributor : Marie TrapeConnect in order to contact the contributor Submitted on : Thursday, August 11, 2011 - 3:56:43 PM Last modification on : Tuesday, July 14, 2020 - 11:04:04 AM Long-term archiving on: : Monday, November 12, 2012 - 3:18:46 PM
Antonia Wachter-Zeh, Valentin Afanassiev, Vladimir Sidorenko. Fast Decoding of Gabidulin Codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.433-442. ⟨inria-00614474⟩