Multi-edge-type LDPC code design with G-EXIT charts for continuous-variable quantum key distribution

December 14, 2018 Β· Declared Dead Β· πŸ› Physical Review A

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hossein Mani, Tobias Gehring, Christoph Pacher, Ulrik Lund Andersen arXiv ID 1812.05867 Category cs.IT: Information Theory Citations 34 Venue Physical Review A Last Checked 6 months ago
Abstract
Continuous-variable quantum key distribution utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. One of the challenges is thereby the requirement of capacity approaching error correcting codes in the low signal-to-noise (SNR) regime (SNR < 0 dB). Multilevel coding (MLC) combined with multistage decoding (MSD) can solve this challenge in combination with multi-edge-type low-density parity-check (MET-LDPC) codes which are ideal for low code rates in the low SNR regime due to degree-one variable nodes. However, the complexity of designing such highly efficient codes remains an open issue. Here, we introduce the concept of generalized extrinsic information transfer (G-EXIT) charts for MET-LDPC codes and demonstrate how this tool can be used to analyze their convergence behavior. We calculate the capacity for each level in the MLC-MSD scheme and use G-EXIT charts to exemplary find codes for some given rates which provide a better decoding threshold compared to previously reported codes. In comparison to the traditional density evolution method, G-EXIT charts offer a simple and fast asymptotic analysis tool for MET-LDPC codes.
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 β€” Information Theory

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