Exponential error bounds for algebraic soft-decision decoding of Reed Solomon codes

Abstract

This paper describes an algebraic soft decision (ASD) decoding algorithms of Reed Solomon codes, which assigns suitable weighted-interpolation and factorization algorithms. The probability of exponential error with an output alphabet multiplicity matrix M is used for decoding the received symbols when ASD algorithm is upper bound. Under the probability of error metric, these algorithms perform better in discrete, memoryless channel.