Journal of Global Optimization
Doubly generalized LDPC codes over the AWGN channel
IEEE Transactions on Communications
Modern Coding Theory
IEEE Transactions on Information Theory
On the information function of an error-correcting code
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
IEEE Transactions on Information Theory
On a class of doubly-generalized LDPC codes with single parity-check variable nodes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Exact erasure channel density evolution for protograph-based generalized LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Information Theory
| Hi-index | 754.91 |
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of the stability condition, and is here referred to as stability bound. In this paper, a stability bound over the BEC is developed for doubly-generalized LDPC codes, where variable and check nodes can be generic linear block codes, assuming maximum a posteriori erasure correction at each node. It is proved that also in this generalized context the bound depends only on the variable and check component codes with minimum distance 2. A condition is also developed, namely, the derivative matching condition, under which the bound is achieved with equality. The stability bound leads to consider single parity-check codes used as variable nodes as an appealing option to overcome common problems created by generalized check nodes.