Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs.pdfVIP

1 Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs Georg Schmidt, Student Member, IEEE, Vladimir R. Sidorenko, Member, IEEE , and Martin Bossert Senior Member, IEEE Department of Telecommunications and Applied Information Theory, University of Ulm, Germany {georg.schmidt,vladimir.sidorenko,martin.bossert}@uni-ulm.de 6 0 0 2 Abstract— Interleaved Reed–Solomon codes are applied in Yung [4] propose an algorithm based on the Welch–Berlekamp t numerous data processing, data transmission, and data storage approach. Parvaresh, and Vardy [8] consider IRS decoding c systems. They are generated by interleaving several codewords in the context of multivariate polynomial interpolation, which O of ordinary Reed–Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. yields a quite powerful list decoding algorithm. 2 However, by collaborative algebraic decoding approaches, such In this paper, we consider IRS codes in a rather general 1 interleaved schemes allow the correction of error patterns beyond way. More precisely we consider IRS codes consisting of l ] half the minimum distance, provided that the errors in the Reed–Solomon codes A(1),A(2) , . . .,A(l) of length N and T received signal occur in bursts. In this work, collaborative dimensions K (1), K(2), . . . , K(l) . We take a codeword fro