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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Schmidt, G., Sidorenko, V. R., & Bossert, M. (2006). Error and erasure correction of interleaved Reed-Solomon codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 22–35). Springer Verlag. https://doi.org/10.1007/11779360_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
