Weight Distribution of Low-Density Parity-Check Codes

We 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.


Published in:
IEEE Transactions on Information Theory, 52, 11, 4839-4855
Year:
2006
Other identifiers:
Laboratories:




 Record created 2006-11-22, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)