Iteration-Dependent Scaled Min-Sum Decoding for Low-Complexity Key Reconciliation in CV-QKD

2023/12/19 by Cil, Erdem Eray, Schmalen, Laurent · 1 citation
#FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2312.12118

Abstract

We introduce an iteration-dependent scaled min-sum decoding for low-rate LDPC codes in CV-QKD, achieving near-sum product algorithm performance with reduced complexity, and facilitating CV-QKD hardware implementation.

Cited by

• Early Termination of Low-Density Parity-Check Codes for Continuous-Variable Quantum Key Distribution

Related

• Log-Log Domain Sum-Product Algorithm for Information Reconciliation in Continuous-Variable Quantum Key Distribution
• Generalized Simplified Variable-Scaled Min Sum LDPC decoder for\n irregular LDPC Codes
• Self-Corrected Min-Sum decoding of LDPC codes
• Min-Max decoding for non binary LDPC codes
• Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation