On the Equivalence of Sudan-Decoding and Decoding via Virtual Extension to an Interleaved Reed-Solomon Code
Konferenz: SCC'10 - 8th International ITG Conference on Source and Channel Coding
18.01.2010 - 21.01.2010 in Siegen, Germany
Seiten: 6Sprache: EnglischTyp: PDFPersönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Zeh, Alexander; Kampf, Sabine; Bossert, Martin (Department of Telecommunications and Applied Information Theory, University of Ulm, Germany)
In this paper we investigate two new decoding schemes for Reed-Solomon codes, which allow to decode beyond half the minimum distance. One is Sudanâ€™s list-decoding principle, based on interpolation with a degree-restricted bivariate polynomial. We show a syndrome-based approach of it. We compare Sudanâ€™s procedure with a scheme that is based on an extension to Interleaved Reed-Solomon codes. We present theoretical parallels and outline both algorithms in a unique comparable way. Furthermore, we show the connection of both schemes to the classical Linear Feedback Shift Register analysis. Afterwards, we compare the performance of the considered schemes.