Computer Science – Information Theory
Scientific paper
2011-04-04
Computer Science
Information Theory
Accepted for the 2011 Canadian Workshop on Information Theory, Kelowna, BC, Canada, May 17 - 20, 2011. 5 pages, 4 figures
Scientific paper
Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both errors and erasures. This enables the decoder to exploit binary quantized reliability information obtained from the transmission channel: Received symbols with high reliability are forwarded to the decoding algorithm while symbols with low reliability are erased. In this paper we investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes, i.e. we derive an adaptive erasing strategy which minimizes the residual codeword error probability after decoding. Our result is applicable to any error/erasure decoding algorithm as long as its decoding capabilities can be expressed by a decoder capability function. Examples are Bounded Minimum Distance decoding with the Berlekamp-Massey- or the Sugiyama algorithms and the Guruswami-Sudan list decoder.
Bossert Martin
Schober Steffen
Senger Christian
Sidorenko Vladimir R.
Zyablov Victor V.
No associations
LandOfFree
Adaptive Single-Trial Error/Erasure 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 Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-318064