• Publications
  • Influence
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
TLDR
We introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. Expand
  • 112
  • 17
  • PDF
Generalized low density (Tanner) codes
TLDR
We build a class of pseudo-random error correcting codes, called generalized low density codes (GLD), from the intersection of two interleaved block codes. Expand
  • 184
  • 14
  • PDF
Hashing with SL_2
TLDR
We propose a new family of hash functions based on computations over a finite field of characteristic 2 based on the arithmetic of the group of matrices SL2. Expand
  • 82
  • 14
Multidimensional reconciliation for continuous-variable quantum key distribution
TLDR
We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. Expand
  • 136
  • 13
  • PDF
Quantum LDPC codes with positive rate and minimum distance proportional to n½
TLDR
We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the blocklength. Expand
  • 64
  • 13
  • PDF
Low Rank Parity Check codes and their application to cryptography
In this paper we introduce a new family of rank metric codes: the Low Rank Parity Check codes for which we propose an e cient probabilistic decoding algorithm. This family of codes can be seen as theExpand
  • 85
  • 11
  • PDF
BIKE: Bit Flipping Key Encapsulation
TLDR
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. Expand
  • 58
  • 11
  • PDF
Error exponents of expander codes
  • A. Barg, G. Zémor
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 24 June 2001
TLDR
We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. Expand
  • 104
  • 10
  • PDF
Group-theoretic hash functions
TLDR
We discuss the security of group-theoretic hash functions for cryptographic purposes. Expand
  • 41
  • 10
Theoretical and Practical Boundaries of Binary Secure Sketches
TLDR
We propose a method that models discrepancies between biometric measurements as an erasure and error channel, and we estimate its capacity. Expand
  • 102
  • 9
...
1
2
3
4
5
...