A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes

Details A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes

2010-01-30

arxiv.org/abs/1002.0043v2

Computer Science

Information Theory

accepted for presentation at 2010 IEEE International Symposium on Information Theory (ISIT 2010), Austin TX, USA

Scientific paper

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides the best performance-versus-complexity trade-off. In this paper, an analysis based on the rate-distortion exponent (RDE) is used to directly minimize the exponential decay rate of the error probability. This enables rigorous bounds on the error probability for finite-length RS codes and leads to modest performance gains. As a byproduct, a numerical method is derived that computes the rate-distortion exponent for independent non-identical sources. Analytical results are given for errors/erasures decoding.

Affiliated with

Also associated with

No associations

Rating

A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for 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 Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251375