Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability - 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

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

Résumé

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.
Fichier principal
Vignette du fichier
ZehWachterBezzateev_MinimumDistance_20120305.pdf (218.78 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00678646 , version 1 (13-03-2012)

Identifiants

Citer

Alexander Zeh, Antonia Wachter-Zeh, Martin Bossert. Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability. Designs, Codes and Cryptography, 2014, 71 (2), pp.261-281. ⟨10.1007/s10623-012-9728-9⟩. ⟨hal-00678646⟩
619 Consultations
286 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More