1. Rate amplification and queryefficient distance amplification for linear LCC and LDC;cohen;36th Computational Complexity Conference (CCC 2021),2021
2. High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
3. Lcc and ldc: Tailor-made distance amplification and a refined separation;cohen;Electronic Colloquium on Computational Complexity (ECCC),2021
4. Local correctability of expander codes
5. Locally testable codes with constant rate, distance, and locality;dinur;arXiv preprint arXiv 2111 02269,2021