| Publication | Date of Publication | Type |
|---|
Repairing Reed-Solomon codes over prime fields via exponential sums
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Viderman's algorithm for quantum LDPC codes
| 2024-11-28 | Paper |
High-probability list-recovery, and applications to heavy hitters
| 2024-06-24 | Paper |
scientific article; zbMATH DE number 7829303 (Why is no real title available?)
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829349 (Why is no real title available?)
| 2024-04-09 | Paper |
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
SIAM Journal on Computing | 2024-04-04 | Paper |
scientific article; zbMATH DE number 7758311 (Why is no real title available?)
| 2023-10-31 | Paper |
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
SIAM Journal on Computing | 2023-07-06 | Paper |
scientific article; zbMATH DE number 7650113 (Why is no real title available?)
| 2023-02-03 | Paper |
Lifted Multiplicity Codes and the Disjoint Repair Group Property
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7559374 (Why is no real title available?)
| 2022-07-18 | Paper |
Bounds for List-Decoding and List-Recovery of Random Linear Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Threshold Rates for Properties of Random Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Low-density parity-check codes achieve list-decoding capacity
SIAM Journal on Computing | 2022-01-07 | Paper |
scientific article; zbMATH DE number 7417713 (Why is no real title available?)
| 2021-10-30 | Paper |
Linear-Time Erasure List-Decoding of Expander Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
A Note on the Permuted Puzzles Toy Conjecture
| 2021-08-17 | Paper |
Improved list-decodability of random linear binary codes
| 2021-08-04 | Paper |
Locality via partially lifted codes
| 2021-07-28 | Paper |
Embedded Index Coding
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Improved List-Decodability of Random Linear Binary Codes
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Superbridge and bridge indices for knots
Journal of Knot Theory and Its Ramifications | 2021-06-08 | Paper |
Hermitian-lifted codes
Designs, Codes and Cryptography | 2021-03-17 | Paper |
Lifted Multiplicity Codes and the Disjoint Repair Group Property
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
| 2020-11-09 | Paper |
Sharp threshold rates for random codes
| 2020-09-09 | Paper |
Local list recovery of high-rate tensor codes and applications
SIAM Journal on Computing | 2020-08-25 | Paper |
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
One-bit compressive sensing of dictionary-sparse signals
Information and Inference: A Journal of the IMA | 2019-08-19 | Paper |
Blind Joint MIMO Channel Estimation and Decoding
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Repairing Multiple Failures for Scalar MDS Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
New constructions of RIP matrices with fast multiplication and fewer rows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Unconstraining graph-constrained group testing
| 2018-09-10 | Paper |
Linear-time list recovery of high-rate expander codes
Information and Computation | 2018-06-14 | Paper |
Average-radius list-recoverability of random linear codes
| 2018-03-15 | Paper |
Improved list-decodability of random linear binary codes
| 2018-01-23 | Paper |
Can we access a database both locally and privately?
| 2018-01-19 | Paper |
Repairing Reed-Solomon Codes
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
Repairing Reed-solomon codes
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
It'll probably work out: improved list-decoding through random operations
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Strategic classification
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Linear-time list recovery of high-rate expander codes
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Every list-decodable code for high noise has abundant near-optimal rate puncturings
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Local correctability of expander codes
Information and Computation | 2015-06-09 | Paper |
1-bit matrix completion
Information and Inference: A Journal of the IMA | 2015-03-06 | Paper |
Configuration spaces of convex and embedded polygons in the plane
Geometriae Dedicata | 2014-10-17 | Paper |
On the list decodability of random linear codes with large error rates
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Local correctability of expander codes
Automata, Languages, and Programming | 2013-08-06 | Paper |
Public key locally decodable codes with short keys
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
