Error performance analysis for reliability-based decoding algorithms

The statistical approach proposed by D. Agrawal and A. Vardy (see IEEE Trans. Inform. Theory, vol.46, pp.60-83, Jan. 2000) to evaluate the error performance of the generalized minimum distance (GMD) decoding is extended to other reliability based decoding algorithms for binary linear block codes, namely Chase-type, combined GMD and Chase-type, and ordered statistic decoding. In all cases, tighter and simpler bounds than previously proposed ones have been obtained with this approach.

[1]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[2]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[3]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[4]  A. Vardy,et al.  Generalized minimum-distance decoding in Euclidean-space: performance analysis , 1997, Proceedings of IEEE International Symposium on Information Theory.