On the Equivalence of Sudan-Decoding and Decoding via Virtual Extension to an Interleaved Reed-Solomon Code

Alexander Zeh 1, 2 Sabine Kampf 2 Martin Bossert 2
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : In this paper we investigate two new decoding schemes for Reed-Solomon codes, which allow to decode beyond half the minimum distance. One is Sudan's list-decoding principle, based on interpolation with a degree-restricted bivariate polynomial. We show a syndrome-based approach of it. We compare Sudan's procedure with a scheme that is based on an extension to Interleaved Reed-Solomon codes. We present theoretical parallels and outline both algorithms in a unique comparable way. Furthermore, we show the connection of both schemes to the classical Linear Feedback Shift Register analysis. Afterwards, we compare the performance of the considered schemes.
Type de document :
Communication dans un congrès
R. Mathar. International ITG Conference on Source and Channel Coding (SCC), Jan 2010, Siegen, Germany. IEEE, pp.1-6, 2010
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00647618
Contributeur : Alexander Zeh <>
Soumis le : vendredi 2 décembre 2011 - 14:18:19
Dernière modification le : mercredi 28 novembre 2018 - 15:36:02
Document(s) archivé(s) le : samedi 3 mars 2012 - 02:31:35

Fichier

SCC2010.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00647618, version 1

Collections

Citation

Alexander Zeh, Sabine Kampf, Martin Bossert. On the Equivalence of Sudan-Decoding and Decoding via Virtual Extension to an Interleaved Reed-Solomon Code. R. Mathar. International ITG Conference on Source and Channel Coding (SCC), Jan 2010, Siegen, Germany. IEEE, pp.1-6, 2010. 〈hal-00647618〉

Partager

Métriques

Consultations de la notice

368

Téléchargements de fichiers

194