Untainted Puncturing for Irregular Low-Density Parity-Check Codes

Abstract

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.

4 pages, 3 figures

References in corpus (1)

• Design and Analysis of E2RC Codes

Cited by in corpus (6)

• Symmetric blind information reconciliation for quantum key distribution
• Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
• High Performance Error Correction for Quantum Key Distribution using Polar Codes
• Asymmetric adaptive LDPC-based information reconciliation for industrial quantum key distribution
• Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution
• Multi-matrix rate-compatible reconciliation for quantum key distribution