Computer Science – Information Theory
Scientific paper
2010-05-31
Computer Science
Information Theory
15 pages, 3 tables
Scientific paper
The main computational steps in algebraic soft-decoding, as well as Sudan-type list-decoding, of Reed-Solomon codes are bivariate polynomial interpolation and factorization. We introduce a computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the complexity of the bivariate interpolation procedure. This re-encoding and coordinate transformation converts the original interpolation problem into another reduced interpolation problem, which is orders of magnitude smaller than the original one. A rigorous proof is presented to show that the two interpolation problems are indeed equivalent. An efficient factorization procedure that applies directly to the reduced interpolation problem is also given.
Koetter Ralf
Ma Jun
Vardy Alexander
No associations
LandOfFree
The Re-Encoding Transformation in Algebraic List-Decoding of 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 The Re-Encoding Transformation in Algebraic List-Decoding of Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Re-Encoding Transformation in Algebraic List-Decoding of Reed-Solomon Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-628255