Donny Kok-Ann Teo

Information Reconciliation is an essential step in Quantum Key Distribution to correct errors in the shared secret between Alice and Bob. In this poster, we generalize the Winnow Information Reconciliation Protocol by replacing the single-bit parity check and Hamming[7,4,3] error-correction code of Winnow by other error detection/correction codes. The error detection codes we investigate include various Cyclic Redundancy Checks (CRC) while the error correction codes we look at include various Hamming, Golay and BCH codes. We simulate Generalized Winnow by considering all possible combinations of these CRC parity-checks and linear codes for QBER between 3%-9%. From our experiments, we identify for each QBER the optimal combination which can correct all errors by (a) Leaking the least number of bits or (b) Using the least number of passes.