| Publication | Date of Publication | Type |
|---|
| Storage codes on coset graphs with asymptotically unit rate | 2025-01-14 | Paper |
| Storage codes and recoverable systems on lines and grids | 2024-12-11 | Paper |
| On the size of maximal binary codes with 2, 3, and 4 distances | 2024-10-08 | Paper |
| High-Rate Storage Codes on Triangle-Free Graphs | 2024-03-14 | Paper |
| STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES | 2023-09-15 | Paper |
| Storage codes and recoverable systems on lines and grids | 2023-08-28 | Paper |
| Bounds for the sum of distances of spherical sets of small size | 2023-03-10 | Paper |
| Quantum spherical codes | 2023-02-22 | Paper |
| Storage codes on coset graphs with asymptotically unit rate | 2022-12-22 | Paper |
| On the size of maximal binary codes with 2, 3, and 4 distances | 2022-10-13 | Paper |
| Node Repair on Connected Graphs | 2022-07-13 | Paper |
| Recoverable Systems | 2022-07-13 | Paper |
| Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces | 2022-06-27 | Paper |
| A construction of maximally recoverable codes | 2022-03-31 | Paper |
| A construction of maximally recoverable codes | 2021-08-19 | Paper |
| Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” | 2021-07-23 | Paper |
| Bounds for discrepancies in the Hamming space | 2021-07-15 | Paper |
| Bounds for the sum of distances of spherical sets of small size | 2021-05-07 | Paper |
| Cyclic and Convolutional Codes With Locality | 2021-02-24 | Paper |
| Capacity of Dynamical Storage Systems | 2021-02-22 | Paper |
| Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes | 2020-12-04 | Paper |
| Error Correction Based on Partial Information | 2020-09-29 | Paper |
| Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model | 2020-01-28 | Paper |
| Codes With Hierarchical Locality From Covering Maps of Curves | 2020-01-28 | Paper |
| Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\) | 2019-10-11 | Paper |
| The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size | 2019-07-19 | Paper |
| Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters | 2019-03-28 | Paper |
| Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy | 2018-09-19 | Paper |
| Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes | 2018-09-14 | Paper |
| Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization | 2018-06-27 | Paper |
| Group Testing Schemes From Codes and Designs | 2018-06-27 | Paper |
| Construction of Polar Codes for Arbitrary Discrete Memoryless Channels | 2018-06-27 | Paper |
| Locally recoverable codes from algebraic curves and surfaces | 2018-04-11 | Paper |
| Minimal supports in linear codes | 2018-03-21 | Paper |
| A broadcast key distribution scheme based on block designs | 2018-03-21 | Paper |
| Locally Recoverable Codes on Algebraic Curves | 2017-10-19 | Paper |
| On the Number of Errors Correctable with Codes on Graphs | 2017-07-27 | Paper |
| Codes in Permutations and Error Correction for Rank Modulation | 2017-07-27 | Paper |
| Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth | 2017-07-27 | Paper |
| Secret Key Generation for a Pairwise Independent Network Model | 2017-07-27 | Paper |
| Coding for High-Density Recording on a 1-D Granular Magnetic Medium | 2017-07-12 | Paper |
| Polar Codes for $q$-Ary Channels, $q=2^{r}$ | 2017-06-08 | Paper |
| Constructions of Rank Modulation Codes | 2017-06-08 | Paper |
| Robust Parent-Identifying Codes and Combinatorial Arrays | 2017-06-08 | Paper |
| Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component | 2017-06-08 | Paper |
| A Family of Optimal Locally Recoverable Codes | 2017-05-16 | Paper |
| Bounds on the Parameters of Locally Recoverable Codes | 2017-04-28 | Paper |
| Restricted Isometry Property of Random Subdictionaries | 2017-04-28 | Paper |
| Interactive function computation via polar coding | 2017-04-19 | Paper |
| Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes | 2017-03-27 | Paper |
| On linear ordered codes | 2016-05-03 | Paper |
| New bounds for equiangular lines | 2016-01-27 | Paper |
| Association schemes on general measure spaces and zero-dimensional abelian groups | 2015-07-13 | Paper |
| Finite two-distance tight frames | 2015-05-27 | Paper |
| Polar codes for distributed hierarchical source coding | 2015-04-14 | Paper |
| Linear codes on posets with extension property | 2014-01-17 | Paper |
| New Bounds for Spherical Two-Distance Sets | 2013-06-24 | Paper |
| Spectral approach to linear programming bounds on codes | 2012-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3000904 | 2011-05-31 | Paper |
| Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption | 2011-05-19 | Paper |
| Bounds on sets with few distances | 2011-04-15 | Paper |
| Bounds on ordered codes and orthogonal arrays | 2009-12-04 | Paper |
| A Functional View of Upper Bounds on Codes | 2009-03-09 | Paper |
| Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes | 2009-02-24 | Paper |
| On the Fingerprinting Capacity Under the Marking Assumption | 2009-02-24 | Paper |
| Weight distribution and decoding of codes on hypergraphs | 2009-02-19 | Paper |
| Distance Distribution of Binary Codes and the Error Probability of Decoding | 2008-12-21 | Paper |
| Distance properties of expander codes | 2008-12-21 | Paper |
| Correction to “Bounds on Packings of Spheres in the Grassmann Manifold” | 2008-12-21 | Paper |
| Concatenated Codes: Serial and Parallel | 2008-12-21 | Paper |
| Improved Error Bounds for the Erasure/List Scheme: The Binary and Spherical Cases | 2008-12-21 | Paper |
| Codes in spherical caps | 2007-04-05 | Paper |
| A bound on Grassmannian codes | 2006-12-07 | Paper |
| Multilevel expander codes | 2006-03-09 | Paper |
| Digital fingerprinting codes: problem statements, constructions, identification of traitors | 2005-06-01 | Paper |
| Error exponents of expander codes | 2005-05-11 | Paper |
| Bounds on packings of spheres in the Grassmann manifold | 2005-05-11 | Paper |
| Random codes: minimum distances and error exponents | 2005-05-11 | Paper |
| A low-rate bound on the reliability of a quantum discrete memoryless channel | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664654 | 2005-04-08 | Paper |
| Error Exponents of Expander Codes under Linear-Complexity Decoding | 2005-02-28 | Paper |
| A class of I.P.P. codes with efficient identification | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470455 | 2004-07-01 | Paper |
| Bounds on the covering radius of linear codes | 2003-04-03 | Paper |
| Strengthening the Gilbert-Varshamov bound | 2002-11-04 | Paper |
| Estimates of the distance distribution of codes and designs | 2002-08-04 | Paper |
| Concatenated codes with fixed inner code and random outer code | 2002-08-04 | Paper |
| Numerical results on the asymptotic rate of binary codes | 2002-07-10 | Paper |
| On some polynomials related to weight enumerators of linear codes | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432453 | 2002-01-01 | Paper |
| A hypergraph approach to the identifying parent property: The case of multiple parents | 2001-11-11 | Paper |
| A hypergraph approach to the identifying parent property: The case of multiple parents | 2001-10-14 | Paper |
| Estimates of the distance distribution of codes and designs | 2001-10-14 | Paper |
| Estimates of the distance distribution of nonbinary codes, with applications | 2001-09-18 | Paper |
| A new upper bound on the reliability function of the Gaussian channel | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945066 | 2001-03-18 | Paper |
| Linear codes with exponentially many light vectors | 2001-01-01 | Paper |
| Quantum error detection .II. Bounds | 2000-09-07 | Paper |
| Quantum error detection .I. Statement of the problem | 2000-09-07 | Paper |
| Linear-time binary codes correcting localized erasures | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242014 | 2000-02-01 | Paper |
| Minimal vectors in linear codes | 1999-11-21 | Paper |
| Binomial moments of the distance distribution: bounds and applications | 1999-11-21 | Paper |
| New upper bounds on generalized weights | 1999-11-21 | Paper |
| On the complexity of minimum distance decoding of long linear codes | 1999-11-21 | Paper |
| Binomial moments of the distance distribution and the probability of undetected error. | 1999-01-01 | Paper |
| The matroid of supports of a linear code | 1997-08-26 | Paper |
| Two families of low-correlated binary sequences | 1997-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886128 | 1997-04-09 | Paper |
| A large family of sequences with low periodic correlation | 1997-01-01 | Paper |
| Incomplete sums, DC-constrained codes, and codes that maintain synchronization | 1993-10-14 | Paper |
| At the dawn of the theory of codes | 1993-05-16 | Paper |
| On computing the weight spectrum of cyclic codes | 1992-10-11 | Paper |
| DC-constrained codes from Hadamard matrices | 1991-01-01 | Paper |
| Algebro-geometric codes on curves of small genera | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792621 | 1987-01-01 | Paper |
| Concatenated decoding algorithm with incomplete inspection of code vectors | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735627 | 1986-01-01 | Paper |
