Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Journal of Global Optimization
Modern Coding Theory
Low-floor tanner codes via hamming-node or RSCC-Node doping
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Simple MAP decoding of first-order Reed-Muller and Hamming codes
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
IEEE Transactions on Information Theory
Bounds on information combining
IEEE Transactions on Information Theory
Extremes of information combining
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Doubly-generalized LDPC codes: stability bound over the BEC
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.12 |
In this paper, the design of doubly generalized low-density parity-check (DGLDPC) codes is proposed. This approach generalizes the structure of LDPC codes at both check and variable nodes. The performance of DGLDPC codes over the AWGN channel is analyzed using EXIT charts. Combined with differential evolution optimization, this analysis provides thresholds for DGLDPC codes that are better than that of LDPC and GLDPC codes with the same maximum variable degree. These theoretical thresholds are verified via simulations. Furthermore DGLDPC codes exhibit a lower error floor compared with their LDPC and GLDPC counterparts.