Error and Erasure Correction of Interleaved Reed–Solomon Codes

摘要

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.