Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Design of rate-compatible structured LDPC codes for hybrid ARQ applications
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
On the usage of projective geometry based LDPC codes for wireless applications
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Design of nonbinary rate-compatible LDPC codes utilizing bit-wise shortening method
IEEE Communications Letters
Information reconciliation for quantum key distribution
Quantum Information & Computation
Quantum Information & Computation
| Hi-index | 0.00 |
This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC) codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppression of error floors are also included in the construction methodology.