Generating functionology
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Random graphs
Discrete Isoperimetric Inequalities and the Probability of a Decoding Error
Combinatorics, Probability and Computing
Modern Coding Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
The threshold probability of a code
IEEE Transactions on Information Theory
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Finite-length scaling of turbo-like code ensembles on the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Waterfall region performance of punctured LDPC codes over the BEC
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Waterfall performance analysis of finite-length LDPC codes on symmetric channels
IEEE Transactions on Communications
Hi-index | 754.84 |
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.