On the Minimum Distance of Generalized LDPC Codes

We study necessary conditions which have to be satisfied in order to have LDPC codes with linear minimum distance. We give two conditions of this kind in this paper. These conditions are not met for several interesting code families: this shows that they are not asymptotically good. The second one concerns LDPC codes that have a Tanner graph in which there are cycles linking variable nodes of degree 2 together and provides some insight about the combinatorial structure of some low-weight codewords in such a case. When the LDPC code family is obtained from the lifts of a given protograph and if there are such cycles in the protograph, the second condition seems to capture really well the linear minimum distance character of the code. This is illustrated by a code family which is asymptotically good for which there is a cycle linking all the variable nodes of degree 2 together. Surprisingly, this family is only a slight modification of a family which does not satisfy the second condition.

[1]  Rüdiger L. Urbanke,et al.  Weight Distribution of Low-Density Parity-Check Codes , 2006, IEEE Transactions on Information Theory.

[2]  Gilles Zémor,et al.  On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation , 2006, 2006 IEEE International Symposium on Information Theory.

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  Marco Breiling,et al.  A logarithmic upper bound on the minimum distance of turbo codes , 2004, IEEE Transactions on Information Theory.

[5]  Dariush Divsalar,et al.  Construction of Protograph LDPC Codes with Linear Minimum Distance , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  Ryoji Ikegaya,et al.  Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles , 2005 .

[7]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[8]  Noga Alon,et al.  The Moore Bound for Irregular Graphs , 2002, Graphs Comb..

[9]  William E. Ryan,et al.  Design of efficiently encodable moderate-length high-rate irregular LDPC codes , 2004, IEEE Transactions on Communications.