Clustering of Cycles and Construction of LDPC Codes

The clustering of cycles to form stopping sets are first observed by T. Tian and et al. As the determination of stopping sets of minimum size is NP-hard, we propose to consider clustering of cycles to avoid the stopping sets of small sizes. In particular, the clustering of two cycles are considered for an improved version of progressive edge-growth construction of LDPC codes.