Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Designs, Codes and Cryptography Année : 2014

Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes

Résumé

An iterated refinement procedure for the Guruswami--Sudan list decoding algorithm for Generalised Reed--Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of closest codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity. We provide a detailed description of the module minimisation, reanalysing the Mulders--Storjohann algorithm and drawing new connections to both Alekhnovich's algorithm and Lee--O'Sullivan's. Furthermore, we show how to incorporate the re-encoding technique of Kötter and Vardy into our iterative algorithm.
Fichier principal
Vignette du fichier
hal-arxiv20140409.pdf (327.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00975927 , version 1 (09-04-2014)

Identifiants

Citer

Johan Sebastian Rosenkilde Nielsen, Alexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes. Designs, Codes and Cryptography, 2014, pp.1-21. ⟨10.1007/s10623-014-9951-7⟩. ⟨hal-00975927⟩
232 Consultations
99 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More