Comparison of Short Blocklength Slepian-Wolf Coding for Key Reconciliation

We focus Slepian-Wolf (SW) coding in the short blocklength for reconciliation in secret key generation and physical unclonable functions. In the problem formulation, two legitimate parties wish to generate a common secret key from a noisy observation of a common random source in the presence of a passive eavesdropper. We consider three different families of codes for key reconciliation. The selected codes show promising performances in information transmission in the short block-length regime. We implement and compare the performance of different codes for SW reconciliation in the terms of reliability and decoding complexity.