Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability

Abstract : A new probabilistic decoding algorithm for low-rate interleaved Reed-Solomon (IRS) codes is presented. This approach increases the error correcting capability of IRS codes compared to other known approaches (e.g. joint decoding) with high probability. It is a generalization of well-known decoding approaches and its complexity is quadratic with the length of the code. Asymptotic parameters of the new approach are calculated and simulation results are shown to illustrate its performance. Moreover, an upper bound on the failure probability is derived.
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00678646
Contributeur : Alexander Zeh <>
Soumis le : mardi 13 mars 2012 - 17:10:19
Dernière modification le : jeudi 21 juin 2018 - 01:22:33
Document(s) archivé(s) le : lundi 26 novembre 2012 - 10:45:34

Fichier

ZehWachterBezzateev_MinimumDis...
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Alexander Zeh, Antonia Wachter, Martin Bossert. Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability. Designs, Codes and Cryptography, Springer Verlag, 2014, 71 (2), pp.261-281. 〈10.1007/s10623-012-9728-9〉. 〈hal-00678646〉

Partager

Métriques

Consultations de la notice

618

Téléchargements de fichiers

192