A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
This work presents a rigorous analysis of an algorithm proposed by Tian et. al  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 givendoi:10.1109/isit.2004.1365107 dblp:conf/isit/RamamoorthyW04 fatcat:w467eukgxndwvleh7pu32jcsj4