We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called "waterfall region." We show that the performance curves in this region follow a simple scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for a fast finite-length optimization. Index Terms-Binary erasure channel, density evolution, error probability curve, finite-length analysis, iterative decoding, lowdensity parity-check (LDPC) codes.
In coding theory, scaling laws were suggested and studied in the context of iterative decoding of LDPC codes in REF .
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Mathematics Computer Science Physics