Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Finite-length rate-compatible LDPC codes: a novel puncturing scheme
IEEE Transactions on Communications
Modern Coding Theory
Design of capacity-approaching irregular low-density parity-check 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
Capacity-achieving sequences for the erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
IEEE Transactions on Information Theory
Nonuniform error correction using low-density parity-check codes
IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
IEEE Transactions on Information Theory
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity Achieving LDPC Codes Through Puncturing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Despite tremendous amount of research on the design of Low-Density Parity-Check (LDPC) codes with belief propagation decoding over different types of Binary-Input Output-Symmetric Memoryless (BIOSM) channels, most results on this topic are based on numerical methods and optimization which do not provide much insight into the design process. In particular, systematic design of provably capacity achieving sequences of LDPC code ensembles over the general class of BIOSM channels, has remained a fundamental open problem. For the case of the Binary Erasure channel, explicit construction of capacity achieving sequences have been proposed based on a property called the flatness condition. In this paper, we propose a systematic method to design universally capacity approaching rate-compatible LDPC code ensemble sequences over BIOSM channels. This is achieved by interpreting the flatness condition over the BEC, as a Successive Maximization (SM) principle that is generalized to other BIOSM channels to design a sequence of capacity approaching ensembles called the parent sequence. The SM principle is then applied to each ensemble within the parent sequence, this time to design rate-compatible puncturing schemes. As part of our results, we extend the stability condition which was previously derived for degree-2 variable nodes to other variable node degrees as well as to the case of rate-compatible codes. Consequently, we rigorously prove that using the SM principle, one is able to design universally capacity achieving rate-compatible LDPC code ensemble sequences over the BEC. Unlike the previous results on such schemes over the BEC in the literature, the proposed SM approach is naturally extendable to other BIOSM channels. The performance of the rate-compatible schemes designed based on our systematic method is comparable to those designed by optimization.