Improved construction of irregular progressive edge-growth Tanner graphs

Abstract

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.

3 pages, 3 figures

References in corpus (1)

• Efficient reconciliation protocol for discrete-variable quantum key distribution

Cited by in corpus (5)

• Symmetric blind information reconciliation for quantum key distribution
• Post-processing procedure for industrial quantum key distribution systems
• Error estimation at the information reconciliation stage of quantum key distribution
• Blind information reconciliation with polar codes for quantum key distribution
• Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution