| Publication | Date of Publication | Type |
|---|
Storage codes on coset graphs with asymptotically unit rate
Combinatorica | 2025-01-14 | Paper |
Storage codes and recoverable systems on lines and grids
Designs, Codes and Cryptography | 2024-12-11 | Paper |
On the size of maximal binary codes with 2, 3, and 4 distances
Combinatorial Theory | 2024-10-08 | Paper |
High-Rate Storage Codes on Triangle-Free Graphs
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
Mathematika | 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
Discrete Mathematics | 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
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Recoverable Systems
IEEE Transactions on Information Theory | 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
Designs, Codes and Cryptography | 2022-03-31 | Paper |
A construction of maximally recoverable codes
(available as arXiv preprint) | 2021-08-19 | 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 |
Bounds for discrepancies in the Hamming space
Journal of Complexity | 2021-07-15 | Paper |
Bounds for the sum of distances of spherical sets of small size
(available as arXiv preprint) | 2021-05-07 | Paper |
Cyclic and Convolutional Codes With Locality
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
Capacity of Dynamical Storage Systems
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Error Correction Based on Partial Information
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Codes With Hierarchical Locality From Covering Maps of Curves
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\)
Electronic Journal of Statistics | 2019-10-11 | Paper |
Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\)
Electronic Journal of Statistics | 2019-10-11 | Paper |
The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
IEEE Transactions on Information Theory | 2019-03-28 | Paper |
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Group Testing Schemes From Codes and Designs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Locally recoverable codes from algebraic curves and surfaces
(available as arXiv preprint) | 2018-04-11 | Paper |
Minimal supports in linear codes
Cryptography and Coding | 2018-03-21 | Paper |
A broadcast key distribution scheme based on block designs
Cryptography and Coding | 2018-03-21 | Paper |
Locally recoverable codes on algebraic curves
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
On the Number of Errors Correctable with Codes on Graphs
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Codes in Permutations and Error Correction for Rank Modulation
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Secret Key Generation for a Pairwise Independent Network Model
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Polar Codes for $q$-Ary Channels, $q=2^{r}$
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Constructions of Rank Modulation Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Robust Parent-Identifying Codes and Combinatorial Arrays
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A Family of Optimal Locally Recoverable Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Bounds on the Parameters of Locally Recoverable Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Restricted Isometry Property of Random Subdictionaries
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Interactive function computation via polar coding
Problems of Information Transmission | 2017-04-19 | Paper |
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
International Journal of Information and Coding Theory | 2017-03-27 | Paper |
On linear ordered codes
Moscow Mathematical Journal | 2016-05-03 | Paper |
New bounds for equiangular lines
(available as arXiv preprint) | 2016-01-27 | Paper |
Association schemes on general measure spaces and zero-dimensional abelian groups
Advances in Mathematics | 2015-07-13 | Paper |
Finite two-distance tight frames
Linear Algebra and its Applications | 2015-05-27 | Paper |
Polar codes for distributed hierarchical source coding
Advances in Mathematics of Communications | 2015-04-14 | Paper |
Linear codes on posets with extension property
Discrete Mathematics | 2014-01-17 | Paper |
New Bounds for Spherical Two-Distance Sets
Experimental Mathematics | 2013-06-24 | Paper |
Spectral approach to linear programming bounds on codes
Problems of Information Transmission | 2012-05-09 | Paper |
scientific article; zbMATH DE number 5901461 (Why is no real title available?)
(available as arXiv preprint) | 2011-05-31 | Paper |
Digital fingerprinting under and (somewhat) beyond the marking assumption. (Invited talk)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Bounds on sets with few distances
Journal of Combinatorial Theory. Series A | 2011-04-15 | Paper |
| Bounds on ordered codes and orthogonal arrays | 2009-12-04 | Paper |
Bounds on ordered codes and orthogonal arrays
(available as arXiv preprint) | 2009-12-04 | Paper |
A Functional View of Upper Bounds on Codes
Coding and Cryptology | 2009-03-09 | Paper |
Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
On the Fingerprinting Capacity Under the Marking Assumption
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 Distribution of Binary Codes and the Error Probability of Decoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Distance properties of expander codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Correction to “Bounds on Packings of Spheres in the Grassmann Manifold”
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Concatenated Codes: Serial and Parallel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Improved Error Bounds for the Erasure/List Scheme: The Binary and Spherical Cases
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Codes in spherical caps
Advances in Mathematics of Communications | 2007-04-05 | Paper |
A bound on Grassmannian codes
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
Multilevel expander codes
(available as arXiv preprint) | 2006-03-09 | Paper |
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Error exponents of expander codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Bounds on packings of spheres in the Grassmann manifold
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Random codes: minimum distances and error exponents
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
A low-rate bound on the reliability of a quantum discrete memoryless channel
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2154105 (Why is no real title available?) | 2005-04-08 | Paper |
Error Exponents of Expander Codes under Linear-Complexity Decoding
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
A class of I.P.P. codes with efficient identification
Journal of Complexity | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2077078 (Why is no real title available?) | 2004-07-01 | Paper |
Bounds on the covering radius of linear codes
Designs, Codes and Cryptography | 2003-04-03 | Paper |
Strengthening the Gilbert-Varshamov bound
Linear Algebra and its Applications | 2002-11-04 | Paper |
Estimates of the distance distribution of codes and designs
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Concatenated codes with fixed inner code and random outer code
IEEE Transactions on Information Theory | 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
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1996483 (Why is no real title available?) | 2002-01-01 | Paper |
A hypergraph approach to the identifying parent property: The case of multiple parents
SIAM Journal on Discrete Mathematics | 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
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1420994 (Why is no real title available?) | 2001-03-18 | Paper |
Linear codes with exponentially many light vectors
Journal of Combinatorial Theory. Series A | 2001-01-01 | Paper |
Quantum error detection .II. Bounds
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Quantum error detection .I. Statement of the problem
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Linear-time binary codes correcting localized erasures
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1284420 (Why is no real title available?) | 2000-02-01 | Paper |
Minimal vectors in linear codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Binomial moments of the distance distribution: bounds and applications
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
New upper bounds on generalized weights
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On the complexity of minimum distance decoding of long linear codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Binomial moments of the distance distribution and the probability of undetected error.
Designs, Codes and Cryptography | 1999-01-01 | Paper |
The matroid of supports of a linear code
Applicable Algebra in Engineering, Communication and Computing | 1997-08-26 | Paper |
Two families of low-correlated binary sequences
Applicable Algebra in Engineering, Communication and Computing | 1997-06-11 | Paper |
| scientific article; zbMATH DE number 910951 (Why is no real title available?) | 1997-04-09 | Paper |
A large family of sequences with low periodic correlation
Discrete Mathematics | 1997-01-01 | Paper |
Incomplete sums, DC-constrained codes, and codes that maintain synchronization
Designs, Codes and Cryptography | 1993-10-14 | Paper |
At the dawn of the theory of codes
The Mathematical Intelligencer | 1993-05-16 | Paper |
On computing the weight spectrum of cyclic codes
IEEE Transactions on Information Theory | 1992-10-11 | Paper |
DC-constrained codes from Hadamard matrices
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Algebro-geometric codes on curves of small genera
Problems of Information Transmission | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4057436 (Why is no real title available?) | 1987-01-01 | Paper |
Concatenated decoding algorithm with incomplete inspection of code vectors
Problems of Information Transmission | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3968500 (Why is no real title available?) | 1986-01-01 | Paper |
