Computer Science – Information Theory
Scientific paper
2010-06-08
Computer Science
Information Theory
For ISIT 2010
Scientific paper
10.1109/ISIT.2010.5513427
The Welch--Berlekamp approach for Reed--Solomon (RS) codes forms a bridge between classical syndrome--based decoding algorithms and interpolation--based list--decoding procedures for list size l=1. It returns the univariate error--locator polynomial and the evaluation polynomial of the RS code as a y-root. In this paper, we show the connection between the Welch--Berlekamp approach for a specific Interleaved Reed--Solomon code scheme and the Guruswami--Sudan principle. It turns out that the decoding of Interleaved RS codes can be formulated as a modified Guruswami--Sudan problem with a specific multiplicity assignment. We show that our new approach results in the same solution space as the Welch--Berlekamp scheme. Furthermore, we prove some important properties.
Senger Christian
Zeh Alexander
No associations
LandOfFree
A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-39074