LDPC-based Gaussian key reconciliation
- 13 March 2006
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
International audienceWe propose a new information reconciliation method which allows two parties sharing continuous random variables to agree on a common bit string. We show that existing coded modulation techniques can be adapted for reconciliation and give an explicit code construction based on LDPC codes in the case of Gaussian variables. Simulations show that our method achieves higher efficiency than previously reported resultsKeywords
This publication has 11 references indexed in Scilit:
- Reconciliation of a Quantum-Distributed Gaussian KeyIEEE Transactions on Information Theory, 2004
- Quantum key distribution using gaussian-modulated coherent statesNature, 2003
- Low density parity check matrices for coding of correlated sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Compression of binary sources with side information at the decoder using LDPC codesIEEE Communications Letters, 2002
- Quantum cryptographyReviews of Modern Physics, 2002
- Convergence behavior of iteratively decoded parallel concatenated codesIEEE Transactions on Communications, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Multilevel codes: theoretical concepts and practical design rulesIEEE Transactions on Information Theory, 1999
- Bit-interleaved coded modulationIEEE Transactions on Information Theory, 1998
- Generalized privacy amplificationIEEE Transactions on Information Theory, 1995