Eliminating small stopping sets in irregular low-density parity-check codes
IEEE Communications Letters
Efficient reconciliation protocol for discrete-variable quantum key distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Information reconciliation for quantum key distribution
Quantum Information & Computation
Hi-index | 0.00 |
The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions. The proposed algorithm is thus interesting if a family of irregular codes with a complex check node degree distribution is used.