| Publication | Date of Publication | Type |
|---|
| High-Rate Storage Codes on Triangle-Free Graphs | 2024-03-14 | Paper |
| LRPC codes with multiple syndromes: near ideal-size KEMs without ideals | 2023-07-07 | Paper |
| Ouroboros: An Efficient and Provably Secure KEM Family | 2022-10-11 | Paper |
| Coding Constructions for Efficient Oblivious Transfer From Noisy Channels | 2022-07-13 | Paper |
| Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders | 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 | 2021-09-07 | Paper |
| Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” | 2021-07-23 | Paper |
| Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding | 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 | 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 | 2018-10-24 | Paper |
| Revisiting Kneser's theorem for field extensions | 2018-09-24 | Paper |
| Efficient Encryption From Random Quasi-Cyclic Codes | 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 | 2018-06-27 | Paper |
| An analogue of Vosper's theorem for extension fields | 2017-10-24 | Paper |
| Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels | 2017-07-27 | Paper |
| Constructions of Rank Modulation Codes | 2017-06-08 | Paper |
| Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength | 2017-06-08 | Paper |
| A Construction of Quantum LDPC Codes From Cayley Graphs | 2017-06-08 | Paper |
| Upper Bounds on the Size of Grain-Correcting Codes | 2017-05-16 | Paper |
| On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes | 2017-04-28 | Paper |
| Critical Pairs for the Product Singleton Bound | 2017-04-28 | Paper |
| Squares of Random Linear Codes | 2017-04-28 | Paper |
| Perfectly Secure Message Transmission in Two Rounds | 2016-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816070 | 2016-07-01 | Paper |
| A homological upper bound on critical probabilities for hyperbolic percolation | 2016-06-16 | Paper |
| RankSign: An Efficient Signature Algorithm Based on the Rank Metric | 2015-01-14 | Paper |
| Yahya Ould Hamidoune's mathematical journey: a critical review of his work | 2014-07-29 | Paper |
| A structure theorem for small sumsets in nonabelian groups | 2014-07-29 | Paper |
| New Results for Rank-Based Cryptography | 2014-06-24 | Paper |
| High-order Masking by Using Coding Theory and Its Application to AES | 2014-01-17 | Paper |
| Cycle codes of graphs and MDS array codes | 2013-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4648137 | 2012-11-08 | Paper |
| Upper Bounds on the Rate of Low Density Stabilizer Codes for the Quantum Erasure Channel | 2012-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3102714 | 2011-12-07 | Paper |
| Full Cryptanalysis of the Chen Identification Protocol | 2011-11-25 | Paper |
| Bounds for binary codes relative to pseudo-distances of \(k\) points | 2011-06-03 | Paper |
| On the critical pair theory in abelian groups: beyond Chowla's theorem | 2009-12-28 | Paper |
| Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression | 2009-12-02 | Paper |
| On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction | 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 | 2009-04-29 | Paper |
| On some subgroup chains related to Kneser's theorem | 2009-04-14 | Paper |
| Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes | 2009-02-24 | Paper |
| Weight distribution and decoding of codes on hypergraphs | 2009-02-19 | Paper |
| Concatenated Codes: Serial and Parallel | 2008-12-21 | Paper |
| Distance properties of expander codes | 2008-12-21 | Paper |
| On quasi-cyclic interleavers for parallel turbo codes | 2008-12-21 | Paper |
| The Gaussian Isoperimetric Inequality and Decoding Error Probabilities for the Gaussian Channel | 2008-12-21 | Paper |
| Witness Sets | 2008-11-25 | Paper |
| Collisions for the LPS Expander Graph Hash Function | 2008-04-15 | Paper |
| On the construction of dense lattices with a given automorphisms group | 2007-08-01 | Paper |
| On codes identifying vertices in the two-dimensional square lattice with diagonals | 2007-01-09 | Paper |
| On the critical pair theory in Z/pZ | 2006-05-17 | Paper |
| Multilevel expander codes | 2006-03-09 | Paper |
| Error exponents of expander codes | 2005-05-11 | Paper |
| Error Exponents of Expander Codes under Linear-Complexity Decoding | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413866 | 2003-07-21 | Paper |
| Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding | 2003-02-02 | Paper |
| Discrete Isoperimetric Inequalities and the Probability of a Decoding Error | 2003-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536637 | 2002-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536648 | 2002-11-23 | Paper |
| On expander codes | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510795 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776533 | 2002-02-28 | Paper |
| Codes with forbidden distances | 2001-11-19 | Paper |
| A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents | 2001-11-11 | Paper |
| Binary \(B_2\)-sequences: a new upper bound | 2001-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741388 | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741418 | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717197 | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728356 | 2001-08-01 | Paper |
| Bounds for Codes Identifying Vertices in the Hexagonal Grid | 2001-03-19 | Paper |
| Antichain codes | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500967 | 2000-09-25 | Paper |
| On the Error-Correcting Capabilities of Cycle Codes of Graphs | 2000-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500987 | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954415 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954434 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945357 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940678 | 2000-03-01 | Paper |
| On the characterization of linear uniquely decodable codes | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256493 | 1999-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249639 | 1999-06-17 | Paper |
| New bounds for codes identifying vertices in graphs | 1999-03-31 | Paper |
| An upper bound on the size of the snake-in-the-box | 1998-03-26 | Paper |
| Optimal Cycle Codes Constructed From Ramanujan Graphs | 1998-02-09 | Paper |
| On greedy algorithms in coding theory | 1997-04-27 | Paper |
| On the traveling salesman problem in binary Hamming spaces | 1996-12-12 | Paper |
| On zero-free subset sums | 1996-11-21 | Paper |
| Tilings of Binary Spaces | 1996-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886131 | 1996-07-28 | Paper |
| The threshold probability of a code | 1995-12-17 | Paper |
| Intersecting codes and independent families | 1995-10-09 | Paper |
| Upper bounds on generalized distances | 1995-10-09 | Paper |
| Hash functions and Cayley graphs | 1994-11-01 | Paper |
| A generalisation to noncommutative groups of a theorem of Mann | 1994-04-04 | Paper |
| Write-isolated memories (WIMs) | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037494 | 1993-05-18 | Paper |
| Application of coding theory to interconnection networks | 1993-01-16 | Paper |
| Subset sums in binary spaces | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360123 | 1991-01-01 | Paper |
| On positive and negative atoms of Cayley digraphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723956 | 1987-01-01 | Paper |
