English

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

Information Theory 2023-12-20 v1 math.IT Quantum Physics

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.

Keywords

Cite

@article{arxiv.2312.12118,
  title  = {Iteration-Dependent Scaled Min-Sum Decoding for Low-Complexity Key Reconciliation in CV-QKD},
  author = {Erdem Eray Cil and Laurent Schmalen},
  journal= {arXiv preprint arXiv:2312.12118},
  year   = {2023}
}

Comments

Accepted and to be presented at the Optical Fiber Communication Conference (OFC) 2024

R2 v1 2026-06-28T13:56:01.402Z