Skip to Main content Skip to Navigation
Conference papers

List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes

Hannes Bartz 1, * 
Abstract : An efficient interpolation-based decoding algorithm for folded Gabidulin codes is presented that can correct rank errors beyond half the minimum rank distance for any code rate R ∈ [0, 1]. The algorithm serves as a list decoder or as a probabilistic unique decoder and improves upon existing schemes, especially for high code rates. A probabilistic unique decoder with adjustable decoding radius is presented. The de-coder outputs a unique solution with high probability and requires at most O(s^2 n^2) operations in Fqm , where s is a decoding parameter and n is the length of the unfolded code. An upper bound on the average list size and on the decoding failure probability of the decoder is given.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Friday, February 19, 2016 - 7:36:56 AM
Last modification on : Thursday, January 6, 2022 - 11:38:04 AM
Long-term archiving on: : Saturday, November 12, 2016 - 11:56:40 PM


Files produced by the author(s)


  • HAL Id : hal-01276220, version 1



Hannes Bartz. List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276220⟩



Record views


Files downloads