Rate compatible protocol for information reconciliation: An application to QKD

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Elkouss, David ^a   Martinez, Jesus ^a   Lancho, Daniel ^a   Martin, Vicente ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Low density parity check (LDPC) codes; Puncturing; Rate compatible; Reconciliation; Shortening

Indexed keywords

DISCRETE VARIABLES; ERROR RATE; ESSENTIAL COMPONENT; INTERACTIVITY; KEY AGREEMENT PROTOCOL; LOW-DENSITY PARITY-CHECK CODES; NOISY CHANNEL; QUANTUM KEY DISTRIBUTION PROTOCOLS; RECONCILIATION PROTOCOLS;

BLOCK CODES; CODING ERRORS; INFORMATION THEORY; QUANTUM CHEMISTRY; QUANTUM CRYPTOGRAPHY; SATELLITE COMMUNICATION SYSTEMS;

FREQUENCY SELECTIVE FADING;

EID: 77954822655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503195     Document Type: Conference Paper

References (21)

1. U. M. Maurer, "Secret key agreement by public discussion from common information," Information Theory, IEEE Transactions on, vol. 39, pp. 733-742, 1993.
2. G. Brassard and L. Salvail, "Secret-key reconciliation by public discussion," in Eurocrypt'93, Workshop on the theory and application of cryptographic techniques on Advances in cryptology, ser. Lecture Notes in Computer Science, vol. 765. Springer-Verlag, 1994, pp. 410-423.
3. S. Watanabe, R. Matsumoto, T. Uyematsu, and Y. Kawano, "Key rate of quantum key distribution with hashed two-way classical communication," in Information Theory, IEEE International Symposium on, Jun. 2007, pp. 2601-2605.
4. S. Watanabe, R. Matsumoto, and T. Uyematsu, "Tomography increases key rates of quantum-key-distribution protocols," Phys. Rev. A, vol. 78, no. 4, p. 042316, 2008.
5. A. Leverrier, R. Alléaume, J. Boutros, G. Zémor, and P. Grangier, "Multidimensional reconciliation for continuous-variable quantum key distribution," Phys. Rev. A, vol. 77, no. 4, pp. 042325-+, Apr. 2008.
6. D. Elkouss, A. Leverrier, R. Alleaume, and J. J. Boutros, "Efficient reconciliation protocol for discrete-variable quantum key distribution," in Information Theory, 2009 IEEE International Symposium on, Jul. 2009, pp. 1879-1883.
7. N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, "Quantum cryptography," Rev. of Mod. Phys., vol. 74, no. 1, pp. 145-195, Mar. 2002.
8. R. Matsumoto, "Problems in application of ldpc codes to information reconciliation in quantum key distribution protocols," 2009. [Online]. Available: arXiv.org:0908.2042
9. D. Slepian and J. Wolf, "Noiseless coding of correlated information sources," Information Theory, IEEE Transactions on, vol. 19, no. 4, pp. 471-480, Jul. 1973.
10. W. Buttler, S. Lamoreaux, J. Torgerson, G. Nickel, C. Donahue, and C. Peterson, "Fast, efficient error reconciliation for quantum cryptography," Phys. Rev. A, vol. 67, no. 5, pp. 052303-+, May 2003.
11. T. Sugimoto and K. Yamazaki, "A study on secret key reconciliation protocol cascade," IEICE Trans. Fundamentals, vol. E83-A, no. 10, pp. 1987-1991, Oct. 2000.
12. S. Liu, H. C. V. Tilborg, and M. V. Dijk, "A practical protocol for advantage distillation and information reconciliation," Des. Codes Cryptography, vol. 30, no. 1, pp. 39-62, 2003.
13. R. G. Gallager, Low-density parity-check codes. MITPress,Cambridge,, 1963.
14. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," Information Theory, IEEE Transactions on, vol. 47, no. 2, pp. 619-637, Feb. 2001.
15. T. Tian and C. R. Jones, "Construction of rate-compatible ldpc codes utilizing information shortening and parity puncturing," EURASIP J. Wirel. Commun. Netw., vol. 2005, no. 5, pp. 789-795, 2005.
16. S.-Y. Chung, J. Forney, G.D., T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 db of the shannon limit," Communications Letters, IEEE, vol. 5, no. 2, pp. 58-60, Feb. 2001.
17. J. Martinez, D. Elkouss, D. Lancho, and V. Martin, "An easy and improved progressive edge growth construction," To be published else-where.
18. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," Information Theory, IEEE Transactions on, vol. 51, no. 1, pp. 386-398, Jan. 2005.
19. J. Ha, J. Kim, and S. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," Information Theory, IEEE Transactions on, vol. 50, no. 11, pp. 2824-2836, Nov. 2004.
20. G. Richter, S. Stiglmayr, and M. Bossert, "Optimized asymptotic puncturing distributions for different ldpc code constructions," in Information Theory, IEEE International Symposium on, Jul. 2006, pp. 831-835.
21. D. Klinc, J. Ha, and S. McLaughlin, "Optimized puncturing and shortening distributions for nonbinary ldpc codes over the binary erasure channel," in Communication, Control, and Computing, 2008 46th Annual Allerton Conference on, Sep. 2008, pp. 1053-1058.