Computer Science – Information Theory
Scientific paper
2007-01-04
Computer Science
Information Theory
10 pages, 4 figures, submitted for publication
Scientific paper
We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan hard-decision decoding for a subset of low-rate codes. These results are also extended to multivariable interpolation in the sense of Parvaresh and Vardy. An upper bound is then presented for ASD's probability of error, where an error is defined as the event that the decoder selects an erroneous codeword from its list. This new definition gives a more accurate bound on the probability of error of ASD than the results available in the literature.
Barg Alexander
Duggan Andrew
No associations
LandOfFree
Performance Analysis of Algebraic Soft-Decision 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 Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-310013