| Publication | Date of Publication | Type |
|---|
| Towards local testability for quantum coding | 2026-04-15 | Paper |
A variant of the Bravyi-Terhal bound for arbitrary boundary conditions
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Kneser's theorem for codes and \(\ell\)-divisible set families
Finite Fields and their Applications | 2026-01-26 | Paper |
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| Quantum Tanner codes | 2025-08-15 | Paper |
| Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders | 2025-08-12 | Paper |
| Quantum expander codes | 2025-08-05 | Paper |
Analysis of the error-correcting radius of a renormalization decoder for Kitaev's toric code
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Efficient error-correcting codes for the HQC post-quantum cryptosystem
Designs, Codes and Cryptography | 2024-12-11 | Paper |
Decoding quantum Tanner codes
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
High-Rate Storage Codes on Triangle-Free Graphs
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
Post-Quantum Cryptography | 2023-07-07 | Paper |
Ouroboros: An Efficient and Provably Secure KEM Family
IEEE Transactions on Information Theory | 2022-10-11 | Paper |
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
SIAM Journal on Computing | 2022-07-08 | Paper |
| Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes | 2022-06-15 | Paper |
Linear-Time Erasure List-Decoding of Expander Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
| Durandal: a rank metric based signature scheme | 2020-02-04 | Paper |
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
| Towards local testability for quantum coding | 2019-11-08 | Paper |
| Localisation-resistant random words with small alphabets | 2019-11-06 | Paper |
Towards a function field version of Freiman's theorem
Algebraic Combinatorics | 2018-10-24 | Paper |
Revisiting Kneser's theorem for field extensions
Combinatorica | 2018-09-24 | Paper |
Efficient Encryption From Random Quasi-Cyclic Codes
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
| Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory | 2018-09-12 | Paper |
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
An analogue of Vosper's theorem for extension fields
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-10-24 | Paper |
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A Construction of Quantum LDPC Codes From Cayley Graphs
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Constructions of Rank Modulation Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Upper Bounds on the Size of Grain-Correcting Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Critical Pairs for the Product Singleton Bound
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Squares of Random Linear Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Perfectly Secure Message Transmission in Two Rounds
Theory of Cryptography | 2016-12-21 | Paper |
| A hypergraph approach to digital fingerprinting | 2016-07-01 | Paper |
A homological upper bound on critical probabilities for hyperbolic percolation
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions | 2016-06-16 | Paper |
Ranksign: an efficient signature algorithm based on the rank metric
Post-Quantum Cryptography | 2015-01-14 | Paper |
A structure theorem for small sumsets in nonabelian groups
European Journal of Combinatorics | 2014-07-29 | Paper |
Yahya Ould Hamidoune's mathematical journey: a critical review of his work
European Journal of Combinatorics | 2014-07-29 | Paper |
New Results for Rank-Based Cryptography
Progress in Cryptology – AFRICACRYPT 2014 | 2014-06-24 | Paper |
High-order masking by using coding theory and its application to AES
Cryptography and Coding | 2014-01-17 | Paper |
Cycle codes of graphs and MDS array codes
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
| Chinese remainder theorem, Reed-Solomon codes, and list decoding | 2012-11-08 | Paper |
| Upper Bounds on the Rate of Low Density Stabilizer Codes for the Quantum Erasure Channel | 2012-05-31 | Paper |
| scientific article; zbMATH DE number 5986690 (Why is no real title available?) | 2011-12-07 | Paper |
Full cryptanalysis of the Chen identification protocol
Post-Quantum Cryptography | 2011-11-25 | Paper |
Bounds for binary codes relative to pseudo-distances of \(k\) points
Advances in Mathematics of Communications | 2011-06-03 | Paper |
On the critical pair theory in abelian groups: beyond Chowla's theorem
Combinatorica | 2009-12-28 | Paper |
Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression
Annales de l’institut Fourier | 2009-12-02 | Paper |
Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression
Annales de l’institut Fourier | 2009-12-02 | Paper |
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
On some subgroup chains related to Kneser's theorem
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
On some subgroup chains related to Kneser's theorem
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
On some subgroup chains related to Kneser's theorem
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Weight distribution and decoding of codes on hypergraphs
Advances in Mathematics of Communications | 2009-02-19 | Paper |
Distance properties of expander codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Concatenated Codes: Serial and Parallel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Gaussian Isoperimetric Inequality and Decoding Error Probabilities for the Gaussian Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On quasi-cyclic interleavers for parallel turbo codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Witness Sets
Coding Theory and Applications | 2008-11-25 | Paper |
Collisions for the LPS Expander Graph Hash Function
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
On the construction of dense lattices with a given automorphisms group
Annales de l’institut Fourier | 2007-08-01 | Paper |
On the construction of dense lattices with a given automorphisms group
Annales de l’institut Fourier | 2007-08-01 | Paper |
On the construction of dense lattices with a given automorphisms group
Annales de l’institut Fourier | 2007-08-01 | Paper |
On the construction of dense lattices with a given automorphisms group
Annales de l’institut Fourier | 2007-08-01 | Paper |
On codes identifying vertices in the two-dimensional square lattice with diagonals
IEEE Transactions on Computers | 2007-01-09 | Paper |
On the critical pair theory in Z/pZ
Acta Arithmetica | 2006-05-17 | Paper |
Multilevel expander codes
(available as arXiv preprint) | 2006-03-09 | Paper |
Error exponents of expander codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Error Exponents of Expander Codes under Linear-Complexity Decoding
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 1951615 (Why is no real title available?) | 2003-07-21 | Paper |
Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding
Cryptography and Coding | 2003-02-02 | Paper |
Discrete isoperimetric inequalities and the probability of a decoding error
Combinatorics, Probability and Computing | 2003-01-13 | Paper |
| scientific article; zbMATH DE number 1759643 (Why is no real title available?) | 2002-11-24 | Paper |
| scientific article; zbMATH DE number 1759652 (Why is no real title available?) | 2002-11-23 | Paper |
On expander codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1522560 (Why is no real title available?) | 2002-07-10 | Paper |
| scientific article; zbMATH DE number 1714662 (Why is no real title available?) | 2002-02-28 | Paper |
Codes with forbidden distances
Discrete Mathematics | 2001-11-19 | Paper |
A hypergraph approach to the identifying parent property: The case of multiple parents
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Binary \(B_2\)-sequences: a new upper bound
Journal of Combinatorial Theory. Series A | 2001-10-29 | Paper |
| A hypergraph approach to the identifying parent property: The case of multiple parents | 2001-10-14 | Paper |
| Performance limits of compound codes with symbol-based iterative decoding | 2001-10-14 | Paper |
| On identifying codes | 2001-09-18 | Paper |
Course on cryptography
Enseignement des Mathématiques (Cassini) | 2001-08-01 | Paper |
Bounds for codes identifying vertices in the hexagonal grid
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Antichain codes
Designs, Codes and Cryptography | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1498642 (Why is no real title available?) | 2000-09-25 | Paper |
On the Error-Correcting Capabilities of Cycle Codes of Graphs
Combinatorics, Probability and Computing | 2000-09-10 | Paper |
| scientific article; zbMATH DE number 1498796 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1456817 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1456834 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1424163 (Why is no real title available?) | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1406765 (Why is no real title available?) | 2000-03-01 | Paper |
On the characterization of linear uniquely decodable codes
Designs, Codes and Cryptography | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 1315277 (Why is no real title available?) | 1999-07-13 | Paper |
| scientific article; zbMATH DE number 1303124 (Why is no real title available?) | 1999-06-17 | Paper |
New bounds for codes identifying vertices in graphs
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
New bounds for codes identifying vertices in graphs
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
An upper bound on the size of the snake-in-the-box
Combinatorica | 1998-03-26 | Paper |
Optimal Cycle Codes Constructed From Ramanujan Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
On greedy algorithms in coding theory
IEEE Transactions on Information Theory | 1997-04-27 | Paper |
On the traveling salesman problem in binary Hamming spaces
IEEE Transactions on Information Theory | 1996-12-12 | Paper |
On zero-free subset sums
Acta Arithmetica | 1996-11-21 | Paper |
Tilings of Binary Spaces
SIAM Journal on Discrete Mathematics | 1996-11-20 | Paper |
| scientific article; zbMATH DE number 910954 (Why is no real title available?) | 1996-07-28 | Paper |
The threshold probability of a code
IEEE Transactions on Information Theory | 1995-12-17 | Paper |
Intersecting codes and independent families
IEEE Transactions on Information Theory | 1995-10-09 | Paper |
Upper bounds on generalized distances
IEEE Transactions on Information Theory | 1995-10-09 | Paper |
Hash functions and Cayley graphs
Designs, Codes and Cryptography | 1994-11-01 | Paper |
A generalisation to noncommutative groups of a theorem of Mann
Discrete Mathematics | 1994-04-04 | Paper |
Write-isolated memories (WIMs)
Discrete Mathematics | 1993-10-24 | Paper |
| scientific article; zbMATH DE number 177615 (Why is no real title available?) | 1993-05-18 | Paper |
Application of coding theory to interconnection networks
Discrete Applied Mathematics | 1993-01-16 | Paper |
Subset sums in binary spaces
European Journal of Combinatorics | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4211967 (Why is no real title available?) | 1991-01-01 | Paper |
On positive and negative atoms of Cayley digraphs
Discrete Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3995979 (Why is no real title available?) | 1987-01-01 | Paper |
