On ensembles of low-density parity-check codes: asymptotic distance distributions
Simon N. Litsyn, Vladimir Shevelev · IEEE Transactions on Information Theory · 2002
We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matrices having given column and row sums, ensembles defined by matrices with given column sums or given row sums, and an ensemble defined by bipartite graphs.