Re-encoding reformulation and application to Welch-Berlekamp algorithm

Morgan Barbier 1, *
* Auteur correspondant
1 Equipe Monétique & Biométrie - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed in order to decrease the complexity of this procedure, but they stay still expensive. Then Koetter, Ma and Vardy proposed in 2010 a technique, called re-encoding, which allows to reduce the practical running time. However, this trick is only devoted for the Koetter interpolation algorithm. We propose a reformulation of the re-encoding for any interpolation methods. The assumption for this reformulation permits only to apply it to the Welch-Berlekamp algorithm.
Type de document :
Communication dans un congrès
Re-encoding reformulation and application to Welch-Berlekamp algorithm, Jun 2014, Hawai'i, United States. IEEE, pp.1782 - 1786, 2014
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-00768536
Contributeur : Morgan Barbier <>
Soumis le : vendredi 11 juillet 2014 - 13:56:23
Dernière modification le : mardi 5 juin 2018 - 10:14:40
Document(s) archivé(s) le : mardi 11 avril 2017 - 12:12:13

Fichiers

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00768536, version 2
  • ARXIV : 1212.5554

Citation

Morgan Barbier. Re-encoding reformulation and application to Welch-Berlekamp algorithm. Re-encoding reformulation and application to Welch-Berlekamp algorithm, Jun 2014, Hawai'i, United States. IEEE, pp.1782 - 1786, 2014. 〈hal-00768536v2〉

Partager

Métriques

Consultations de la notice

657

Téléchargements de fichiers

168