Soft decoding of short/medium length codes using ordered statistics for quantum key distribution

被引:1
作者
Khan, Maqsood M. [1 ]
Bari, Inam [2 ]
Khan, Omar [3 ]
Ullah, Najeeb [3 ,4 ]
Mondin, Marina [5 ]
Daneshgaran, Fred [5 ]
机构
[1] Natl Univ Comp & Emerging Sci, Dept Elect Engn, Islamabad, Pakistan
[2] Mil Technol Coll, Dept Syst Engn, Muscat, Oman
[3] Natl Univ Comp & Emerging Sci, Dept Comp Sci, Islamabad, Pakistan
[4] Natl Univ Sci & Technol, Dept Comp Sci, Quetta, Pakistan
[5] Calif State Univ Los Angeles, Dept Elect & Comp Engn, Los Angeles, CA 90032 USA
关键词
Cyclic codes; ordered statistic decoding; quantum key distribution; LINEAR BLOCK-CODES; REED-SOLOMON; INFORMATION RECONCILIATION; ALGORITHM; PERFORMANCE;
D O I
10.1142/S0219749921500258
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Quantum key distribution (QKD) is a cryptographic communication protocol that utilizes quantum mechanical properties for provable absolute security against an eavesdropper. The communication is carried between two terminals using random photon polarization states represented through quantum states. Both these terminals are interconnected through disjoint quantum and classical channels. Information reconciliation using delay controlled joint decoding is performed at the receiving terminal. Its performance is characterized using data and error rates. Achieving low error rates is particularly challenging for schemes based on error correcting codes with short code lengths. This article addresses the decoding process using ordered statistics decoding for information reconciliation of both short and medium length Bose-Chaudhuri-Hocquenghem codes over a QKD link. The link's quantum channel is modeled as a binary symmetric quantum depolarization channel, whereas the classical channel is configured with additive white Gaussian noise. Our results demonstrate the achievement of low bit error rates, and reduced decoding complexity when compared to other capacity achieving codes of similar length and configuration.
引用
收藏
页数:15
相关论文
共 44 条
[1]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[2]   High-efficiency reconciliation for continuous variable quantum key distribution [J].
Bai, Zengliang ;
Yang, Shenshen ;
Li, Yongmin .
JAPANESE JOURNAL OF APPLIED PHYSICS, 2017, 56 (04)
[3]   ON DECODING BINARY BOSE-CHAUDHURI-HOCQUENGHEM CODES [J].
BERLEKAMP, ER .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (04) :577-579
[4]   Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing [J].
Bhattar, R. K. ;
Ramakrishnan, K. R. ;
Dasgupta, K. S. .
IET COMMUNICATIONS, 2012, 6 (15) :2487-2496
[6]   SOFT DECODING TECHNIQUES FOR CODES AND LATTICES, INCLUDING THE GOLAY CODE AND THE LEECH LATTICE [J].
CONWAY, JH ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) :41-50
[7]   LDPC Coding for QKD at Higher Photon Flux Levels Based on Spatial Entanglement of Twin beams in PDC [J].
Daneshgaran, Fred ;
Mondin, Marina ;
Bari, Inam .
22ND INTERNATIONAL LASER PHYSICS WORKSHOP (LPHYS'13), 2014, 497
[8]   DECODING ALGORITHM FOR BINARY BLOCK CODES AND J-ARY OUTPUT CHANNELS [J].
DORSCH, BG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) :391-394
[9]   Sort-and-match algorithm for soft-decision decoding [J].
Dumer, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) :2333-2338
[10]   Performance of Sphere Decoding of Block Codes [J].
El-Khamy, Mostafa ;
Vikalo, Haris ;
Hassibi, Babak ;
McEliece, Robert J. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (10) :2940-2950