Slepian-Wolf Coding for Reconciliation of Physical Layer Secret Keys

In this paper, we show how to compute the Slepian-Wolf lower bound for the reconciliation of physical layer secret keys between two radio terminals. Two coding approaches, including the syndrome method and the parity method, have been proven to require the same number of bits exchanged between two terminals for the reconciliation in the noiseless environment. We also present a practical coding approach based on LDPC codes, and the gap between the practical approach and the Slepian-Wolf bound is given.