Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes. - Gil Cohen; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2020)

Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC. - Gil Cohen; Tal Yankovitz (CCC, 2021)

LCC and LDC: Tailor-made distance amplification and a refined separation. - Gil Cohen; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2021)

Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet. - Inbar Ben Yaacov; Gil Cohen; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2021)

Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. - Gil Cohen; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2022)

Asymptotically-Good RLCCs with $( log{n})^{2+o(1)}$ Queries. - Gil Cohen; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2023)

A Study of Error Reduction Polynomials. - Gil Cohen; Dean Doron; Tomer Manket; Edward Pyne; Yichuan Wang; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2024)

A stronger bound for linear 3-LCC. - Tal Yankovitz (Electron. Colloquium Comput. Complex., 2024)