Multi-matrix rate-compatible reconciliation for quantum key distribution

January 04, 2020 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Chaohui Gao, Yu Guo, Dong Jiang, Lijun Chen arXiv ID 2001.01074 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 0 Venue arXiv.org Last Checked 5 months ago
Abstract
Key reconciliation of quantum key distribution (QKD) is the process of correcting errors caused by channel noise and eavesdropper to identify the keys of two legitimate users. Reconciliation efficiency is the most important figure for judging the quality of a reconciliation scheme. To improve reconciliation efficiency, rate-compatible technologies was proposed for key reconciliation, which is denoted as the single-matrix ratecompatible reconciliation (SRCR). In this paper, a recently suggested technique called multi-matrix reconciliation is introduced into SRCR, which is referred to as the multi-matrix rate-compatible reconciliation (MRCR), to further improve reconciliation efficiency and promote the throughput of SRCR. Simulation results show that MRCR we proposed outperforms SRCR in reconciliation efficiency and throughput.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted