15 citations · 42 across the 9 of their papers we have counts for
11 papers
Tradeoffs on the volume of fault-tolerant circuits
Anirudh Krishna, Gilles Zémor
Dating back to the seminal work of von Neumann [von Neumann, Automata Studies, 1956], it is known that error correcting codes can overcome faulty circuit components to enable robus…
Quantum Tanner codes
Anthony Leverrier, Gilles Zémor
Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertice…
High-rate storage codes on triangle-free graphs
Alexander Barg, Gilles Zémor
Consider an assignment of bits to the vertices of a connected graph with the property that the value of each vertex is a function of the values of its neighbors. A collect…
Coding Constructions for Efficient Oblivious Transfer from Noisy Channels
Frédérique Oggier, Gilles Zémor
We consider oblivious transfer protocols performed over binary symmetric channels in a malicious setting where parties will actively cheat if they can. We provide constructions pur…
HQC-RMRS, an instantiation of the HQC encryption framework with a more efficient auxiliary error-correcting code
Nicolas Aragon, Philippe Gaborit, Gilles Zémor
The HQC encryption framework is a general code-based encryption scheme for which decryption returns a noisy version of the plaintext. Any instantiation of the scheme will therefore…
Decodable quantum LDPC codes beyond the distance barrier using high dimensional expanders
Shai Evra, Tali Kaufman, Gilles Zémor
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we…