On $A^{\ast}$ Algorithms for Decoding Short Linear Block Codes

The A* algorithm for decoding linear block codes is an efficient tree-search method for decoding short linear block codes. The information contained in the parity bits are potentially useful for reducing the edges needed in the tree search. We propose to extract the information embedded in the parity bits by considering sums of parity bits which can be decided by part of the message bits. Analysis for the number of required message bits for obtaining sums of parity bits is provided. The information contained in the parity bits can help to reduce the number of search tree edges.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

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

[3]  I. G. Núñez,et al.  Generalized Hamming Weights for Linear Codes , 2001 .

[4]  Shu Lin,et al.  Computationally efficient soft-decision decoding of linear block codes based on ordered statistics , 1996, IEEE Trans. Inf. Theory.

[5]  Samuel Dolinar,et al.  A* decoding of block codes , 1996, IEEE Trans. Commun..

[6]  Baoming Bai,et al.  On Short Forward Error-Correcting Codes for Wireless Communication Systems , 2007, 2007 16th International Conference on Computer Communications and Networks.

[7]  Marc P. C. Fossorier,et al.  Soft-decision decoding using time and memory diversification , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Mao-Chao Lin,et al.  Tree-search decoding with path constraints for linear block codes , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[9]  Yunghsiang Sam Han.  A New Treatment of Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[10]  Jakov Snyders,et al.  Reliability-based code-search algorithms for maximum-likelihood decoding of block codes , 1997, IEEE Trans. Inf. Theory.

[11]  Christoforos N. Hadjicostis,et al.  Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification , 2007, IEEE Transactions on Information Theory.

[12]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[13]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[14]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of linear block codes with adaptive belief propagation , 2005, IEEE Communications Letters.

[15]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[16]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[17]  Marc P. C. Fossorier,et al.  Box and match techniques applied to soft-decision decoding , 2002, IEEE Transactions on Information Theory.

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

[19]  Mao-Chao Lin,et al.  Advanced Information of Parity Bits for Decoding Short Linear Block Codes Using the A* Algorithm , 2013, IEEE Transactions on Communications.

[20]  Aditi Kothiyal,et al.  A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[21]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

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

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

[24]  Yunghsiang Sam Han,et al.  Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version , 1998, IEEE Trans. Inf. Theory.