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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00678646
Contributor : Alexander Zeh <>
Submitted on : Tuesday, March 13, 2012 - 5:10:19 PM
Last modification on : Monday, March 4, 2019 - 1:44:09 PM
Long-term archiving on : Monday, November 26, 2012 - 10:45:34 AM

File

ZehWachterBezzateev_MinimumDis...
Publisher files allowed on an open archive

Identifiers

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⟩

Share

Metrics

Record views

887

Files downloads

324