| Publication | Date of Publication | Type |
|---|
Approximate generalized Steiner systems and near-optimal constant weight codes
(available as arXiv preprint) | N/A | Paper |
Near optimal constructions of frameproof codes
(available as arXiv preprint) | N/A | Paper |
Beyond chromatic threshold via (p,q)-theorem, and sharp blow-up phenomenon
(available as arXiv preprint) | N/A | Paper |
Focal-free uniform hypergraphs and codes
Journal of Combinatorial Theory. Series A | 2026-06-19 | Paper |
Constrained coding bounds via Goulden-Jackson cluster theorem
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Stability with minuscule structure for chromatic thresholds
(available as arXiv preprint) | 2026-01-01 | Paper |
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
(available as arXiv preprint) | 2026-01-01 | Paper |
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
(available as arXiv preprint) | 2026-01-01 | Paper |
Sharp bounds for uniform union-free hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Balanced Sperner families via the topological Tverberg theorem
(available as arXiv preprint) | 2026-01-01 | Paper |
An Erdős Matching Conjecture for Vector Spaces
(available as arXiv preprint) | 2026-01-01 | Paper |
Exact Homomorphism Thresholds Beyond Cliques
(available as arXiv preprint) | 2026-01-01 | Paper |
Extremal problems for cancellative and locally thin hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Thresholds and spread in set systems of bounded VC-dimension
(available as arXiv preprint) | 2026-01-01 | Paper |
| Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon | 2025-11-24 | Paper |
| When can an expander code correct (n) errors in O(n) time? | 2025-10-06 | Paper |
When can an expander code correct (n) errors in O(n) time?
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
| Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings (extended abstract) | 2025-08-13 | Paper |
Near optimal probabilistic constructions of frameproof codes
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
Incidence theorems for multivariate polynomials over finite fields
(available as arXiv preprint) | 2025-01-01 | Paper |
Approximate generalized Steiner systems and near-optimal constant weight codes
Journal of Combinatorial Theory. Series A | 2024-11-13 | Paper |
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
SIAM Journal on Computing | 2024-04-04 | Paper |
List-Decoding and List-Recovery of Reed–Solomon Codes Beyond the Johnson Radius for Every Rate
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Singleton-type bounds for list-decoding and list-recovery, and related results
Journal of Combinatorial Theory. Series A | 2024-01-15 | Paper |
Constrained coding upper bounds via Goulden-Jackson cluster theorem
(available as arXiv preprint) | 2024-01-01 | Paper |
Focal-free uniform hypergraphs and codes
(available as arXiv preprint) | 2024-01-01 | Paper |
Asymptotically sharp bounds for cancellative and union-free hypergraphs
(available as arXiv preprint) | 2024-01-01 | Paper |
| Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code | 2023-12-26 | Paper |
Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
SIAM Journal on Discrete Mathematics | 2023-09-06 | Paper |
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
SIAM Journal on Computing | 2023-06-09 | Paper |
| Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes | 2023-01-05 | Paper |
| List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate | 2021-05-31 | Paper |
Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles
Journal of Algebraic Combinatorics | 2021-04-27 | Paper |
Sparse hypergraphs: new bounds and constructions
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
(available as arXiv preprint) | 2021-01-01 | Paper |
New Turán Exponents for Two Extremal Hypergraph Problems
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
| Improved List-Decodability of Reed--Solomon Codes via Tree Packings | 2020-11-09 | Paper |
Sparse hypergraphs with applications to coding theory
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
The hat guessing number of graphs
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
| Error Detection and Correction in Communication Networks | 2020-04-03 | Paper |
Degenerate Turán densities of sparse hypergraphs
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Error Detection and Correction in Communication Networks
(available as arXiv preprint) | 2020-01-01 | Paper |
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
(available as arXiv preprint) | 2020-01-01 | Paper |
A new piggybacking design for systematic MDS storage codes
Designs, Codes and Cryptography | 2019-11-07 | Paper |
Some intriguing upper bounds for separating hash families
Science China. Mathematics | 2019-03-07 | Paper |
Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
New upper bounds for parent-identifying codes and traceability codes
Designs, Codes and Cryptography | 2018-07-03 | Paper |
New Bounds for Frameproof Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
New Bounds and Constructions for Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Sparse hypergraphs: new bounds and constructions
(available as arXiv preprint) | 2017-01-01 | Paper |
Separating hash families: a Johnson-type bound and new constructions
SIAM Journal on Discrete Mathematics | 2016-12-13 | Paper |
| New results for traitor tracing schemes | 2016-10-24 | Paper |
New results for traitor tracing schemes
(available as arXiv preprint) | 2016-01-01 | Paper |
| New bounds on the number of tests for disjunct matrices | 2015-01-14 | Paper |
New bounds on the number of tests for disjunct matrices
(available as arXiv preprint) | 2015-01-01 | Paper |
