Low complexity soft decision decoding algorithms for Reed-Solomon codes

We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Eu clidean distances from the received vector. The decoder searches through th e trellis until it finds a codeword. This results in a soft-decision maximu m likelihood algorithm with lower complexity compared to other known MLD me thods. The proposed MLD algorithm is subsequently modified to further simpl ify complexity, reflecting in a slight reduction in the error performance.