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.
Type de document :
Communication dans un congrès
WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France. 2016, Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015. 〈wcc2015.inria.f〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01276220
Contributeur : Jean-Pierre Tillich <>
Soumis le : vendredi 19 février 2016 - 07:36:56
Dernière modification le : vendredi 19 février 2016 - 16:22:47
Document(s) archivé(s) le : samedi 12 novembre 2016 - 23:56:40

Fichier

wcc15-tu2-4.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01276220, version 1

Collections

Citation

Hannes Bartz. List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France. 2016, Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015. 〈wcc2015.inria.f〉. 〈hal-01276220〉

Partager

Métriques

Consultations de la notice

22

Téléchargements de fichiers

46