Di, C.Richardson, T.Urbanke, R.2006-11-222006-11-222006-11-22200610.1109/TIT.2006.883541https://infoscience.epfl.ch/handle/20.500.14299/235909WOS:0002418057000079558We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative decoding over the binary erasure channel (BEC) known to date have sublinearly growing minimum distance in the block length.text::journal::journal article::research article