| Publication | Date of Publication | Type |
|---|
Efficient list-decoding with constant alphabet and list sizes
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Erasures versus errors in local decoding and property testing
Random Structures & Algorithms | 2023-10-12 | Paper |
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
SIAM Journal on Computing | 2023-07-06 | Paper |
| scientific article; zbMATH DE number 7650135 (Why is no real title available?) | 2023-02-03 | Paper |
From local to robust testing via agreement testing
Theory of Computing | 2022-07-26 | Paper |
| From Local to Robust Testing via Agreement Testing | 2022-07-18 | Paper |
| Erasures vs. errors in local decoding and property testing | 2022-07-18 | Paper |
Efficient list-decoding with constant alphabet and list sizes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Low-density parity-check codes achieve list-decoding capacity
SIAM Journal on Computing | 2022-01-07 | Paper |
Linear-Time Erasure List-Decoding of Expander Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
On List Recovery of High-Rate Tensor Codes
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Local list recovery of high-rate tensor codes and applications
SIAM Journal on Computing | 2020-08-25 | Paper |
Explicit Capacity Approaching Coding for Interactive Communication
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Towards optimal deterministic coding for interactive communication
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
High-rate locally correctable and locally testable codes with sub-polynomial query complexity
Journal of the ACM | 2018-05-17 | Paper |
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Sparse affine-invariant linear codes are locally testable
Computational Complexity | 2017-07-28 | Paper |
On public key encryption from noisy codewords
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
From affine to two-source extractors via approximate duality
SIAM Journal on Computing | 2015-11-18 | Paper |
Space Complexity in Polynomial Calculus
SIAM Journal on Computing | 2015-09-02 | Paper |
Absolutely sound testing of lifted codes
Theory of Computing | 2015-08-21 | Paper |
An additive combinatorics approach relating rank to communication complexity
Journal of the ACM | 2015-08-14 | Paper |
An additive combinatorics approach relating rank to communication complexity
Journal of the ACM | 2015-08-14 | Paper |
A new upper bound on the query complexity of testing generalized Reed-Muller codes
Theory of Computing | 2014-10-06 | Paper |
Sampling-based proofs of almost-periodicity results and algorithmic applications
Automata, Languages, and Programming | 2014-07-01 | Paper |
Absolutely sound testing of lifted codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
A new upper bound on the query complexity for testing generalized Reed-Muller codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
(available as arXiv preprint) | N/A | Paper |
