Loading...
research article
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.
Type
research article
Web of Science ID
WOS:000241805700007
Authors
Publication date
2006
Published in
Volume
52
Issue
11
Start page
4839
End page
4855
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
November 22, 2006
Use this identifier to reference this record