2.8k citations · 5.3k across the 47 of their papers we have counts for
6 papers · 1 filter
Improved construction of irregular progressive edge-growth Tanner graphs
Jesus Martinez-Mateo, David Elkouss, Vicente Martin
The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the o…
Information Reconciliation for Quantum Key Distribution
David Elkouss, Jesus Martinez-Mateo, Vicente Martin
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executin…
Secure rate-adaptive reconciliation
David Elkouss, Jesus Martinez-Mateo, Vicente Martin
We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion w…
Interactive Reconciliation with Low-Density Parity-Check Codes
Jesus Martinez-Mateo, David Elkouss, Vicente Martin
Efficient information reconciliation is crucial in several scenarios, being quantum key distribution a remarkable example. However, efficiency is not the only requirement for deter…
QKD in Standard Optical Telecommunications Networks
D. Lancho, J. Martinez, D. Elkouss +2
To perform Quantum Key Distribution, the mastering of the extremely weak signals carried by the quantum channel is required. Transporting these signals without disturbance is custo…
Rate Compatible Protocol for Information Reconciliation: An application to QKD
David Elkouss, Jesus Martinez-Mateo, Daniel Lancho +1
Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol w…