Analysis of an algorithm for irregular LDPC code construction

A. Ramamoorthy, R.D. Wesel
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.  
This work presents a rigorous analysis of an algorithm proposed by Tian et. al [1] for the construction of irregular LDPC codes with reduced stopping sets and low error floors. Computation of the expected number of stopping sets of a given size proves that the algorithm significantly outperforms a random construction. We show that the algorithm provably reduces the expected number of stopping sets up to a certain size (based on the input parameters). The expected number of cycles of a given
more » ... cles of a given size is computed for both constructions.
doi:10.1109/isit.2004.1365107 dblp:conf/isit/RamamoorthyW04 fatcat:w467eukgxndwvleh7pu32jcsj4