activity
20092025
most citedExperimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km

2.8k citations · 5.3k across the 47 of their papers we have counts for

collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT2016★ 24 cited

Memory effects can make the transmission capability of a communication channel uncomputable

David Elkouss, David Pérez-García

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transm…

cs.IT2011★ 22 cited

Untainted Puncturing for Irregular Low-Density Parity-Check Codes

David Elkouss, Jesus Martinez-Mateo, Vicente Martin

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes…

cs.IT2010★ 22 cited

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…

cs.IT2010★ 13 cited

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…

cs.IT2010★ 14 cited

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…

cs.IT2010★ 49 cited

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…

cs.IT2009★ 99 cited

Efficient reconciliation protocol for discrete-variable quantum key distribution

David Elkouss, Anthony Leverrier, Romain Alléaume +1

Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated d…