Abstract
We present an algorithm for error and erasure correction of interleaved Reed–Solomon codes. Our algorithm is based on an algorithm recently proposed by Bleichenbacher et al. This algorithm is able to correct many error patterns beyond half the minimum distance of the interleaved Reed–Solomon code. We extend the algorithm in a way, that it is not only able to correct errors, but can correct both, errors and erasures simultaneously. Furthermore we present techniques to describe the algorithm in an efficient way. This can help to reduce the complexity when implementing the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bleichenbacher, D., Kiayias, A., Young, M.: Decoding of interleaved Reed Solomon codes over noisy data. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 97–108. Springer, Heidelberg (2003)
Justesen, J., Thommesen, C., Høholdt, T.: Decoding of concatenated codes with interleaved outer codes. In: Proc. of IEEE Intern. Symposium on Inf. Theory, Chicago, USA, p. 329 (2004)
Welch, L.R., Berlekamp, E.R.: Error correction for algebraic block codes. U. S. Patent 4 633 470, issued December 30 (1986)
Althaus, H.L., Leake, R.J.: Inverse of a finite-field Vandermonde matrix. IEEE Trans. Inform. Theory 15, 173 (1969)
Klinger, A.: The Vandermonde matrix. Amer. Math. Monthly 74, 571–574 (1967)
Brown, A., Minder, L., Shokrollahi, A.: Probabilistic decoding of interleaved rs-codes on the q-ary symmetric channel. In: Proc. of IEEE Intern. Symposium on Inf. Theory, Chicago, USA, p. 327 (2004)
Schmidt, G., Sidorenko, V.R., Bossert, M.: Interleaved Reed–Solomon codes in concatenated code designs. In: Proc. of IEEE ISOC ITW2005 on Coding and Complexity, Rotorua, New Zealand, pp. 187–191 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, G., Sidorenko, V.R., Bossert, M. (2006). Error and Erasure Correction of Interleaved Reed–Solomon Codes. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_3
Download citation
DOI: https://doi.org/10.1007/11779360_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)