A Chernoff type error bound for algebraic soft-decision decoding of Reed Solomon codes

We present exponential upper bounds on the performance of algebraic soft-decision decoding algorithm in the decoding of Reed-Solomon codes for a symmetric channel. The symmetric channels are useful for computing the performance of the algebraic soft-decision decoding algorithm in regimes where the probability of error is low. In such regimes, these bounds are of particular interest since it is impractical to run simulations. The bounds are Chernoff-type error bounds.