Performance study of a class of irregular LDPC codes based on their weight distribution analysis

This paper investigates the performance of irregular low-density parity-check (LDPC) codes on memoryless BI-AWGN (Binary Input - Additive White Gaussian Noise) channels, with sum-product decoding. Objective of this work is to study the relationship between an LDPC code performance and some parameters specifying the code itself, such as the coefficients of its degree distributions. In fact, these coefficients where shown in Di et al.'s 2006 paper to determine the growth rate of the minimum distance of an LDPC code, which can be only sublinear in the block length in some well defined conditions of the degree distribution pair.