List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

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

Résumé

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.
Fichier principal
Vignette du fichier
wcc15-tu2-4.pdf (294.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01276220 , version 1 (19-02-2016)

Identifiants

  • HAL Id : hal-01276220 , version 1

Citer

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⟩

Collections

WCC2015
41 Consultations
58 Téléchargements

Partager

Gmail Facebook X LinkedIn More