论文信息 - Maximum likelihood decoding of Reed Solomon codes

Maximum likelihood decoding of Reed Solomon codes

This paper presents a bit level soft decision decoding algorithm for Reed-Solomon codes of moderately low complexity. Coset properties of Reed-Solomon codes represented in GF(2) are used to derive an efficient maximum likelihood decoding algorithm. The algorithm could be easily modified to produce soft output estimates.

B. Vucetic | V. Ponnampalam

[1] Alexander Vardy,et al. Bit-level soft-decision decoding of Reed-Solomon codes , 1991, IEEE Trans. Commun..

[2] Stephen B. Wicker,et al. Reed-Solomon Codes and Their Applications , 1999 .

[3] Jack K. Wolf,et al. Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[4] Patrick A. H. Bours,et al. On maximum likelihood soft-decision decoding of binary linear codes , 1993, IEEE Trans. Inf. Theory.