| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Fast Decoding of Gabidulin Codes
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.
Cited literature [12 references]
https://hal.inria.fr/inria-00614474
Contributor : Marie Trape Connect 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
Contributor : Marie Trape Connect 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
File
13.pdf
Files produced by the author(s)