Further Results on Survivor Error Patterns for Maximum Likelihood Decoding

Survivor error patterns for the (63,57,3) Hamming code are presented. This reduced list of error patterns enables rather efficient maximum likelihood soft decision decoding of the Hamming code and large turbo-like codes whose constituents are the aforementioned Hamming codes. The list of survivor error patterns for the (63,57,3) Hamming code possesses certain properties unshared by the lists of survivors for smaller Hamming codes. Also, we demonstrate that the weight distribution is a powerful means in specifying survivor error patterns for codes other than Hamming codes.

[1]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[2]  Joachim Hagenauer,et al.  Approaching Shannon's capacity limit by 0.27 dB using Hamming codes in a 'turbo'-decoding scheme , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Jakov Snyders.  Partial Ordering of Error Patterns for Maximum Likelihood Soft Decoding , 1991, Algebraic Coding.

[4]  Yunghsiang Sam Han,et al.  Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes , 1993, IEEE Trans. Inf. Theory.

[5]  Shigeichi Hirasawa,et al.  An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder , 1994, IEEE Trans. Inf. Theory.

[6]  Jakov Snyders,et al.  Reduced lists of error patterns for maximum likelihood soft decoding , 1991, IEEE Trans. Inf. Theory.

[7]  Shigeichi Hirasawa,et al.  Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  Yair Be'ery,et al.  Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes , 1989, IEEE Trans. Inf. Theory.

[9]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[10]  Tai-Yang Hwang.  Efficient optimal decoding of linear block codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

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

[12]  Li Ping,et al.  Efficient soft-in-soft-out sub-optimal decoding rule for single parity check codes , 1997 .

[13]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..

[14]  Shigeichi Hirasawa,et al.  Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[15]  Arnold M. Michelson,et al.  Viterbi decoding of the (63, 57) Hamming code-implementation and performance results , 1995, IEEE Trans. Commun..