research
∙
08/29/2023
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
A code C {0,1}^k →{0,1}^n is a q-locally decodable code (q-LDC) if one c...
share
research
∙
08/25/2023
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
A simple, recently observed generalization of the classical Singleton bo...
research
∙
04/19/2023
Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields
Reed–Solomon codes are a classic family of error-correcting codes consis...
research
∙
05/27/2022
Low-Degree Polynomials Extract from Local Sources
We continue a line of work on extracting random bits from weak sources t...
research
∙
08/28/2021
Visible Rank and Codes with Locality
We propose a framework to study the effect of local recovery requirement...
research
∙
01/16/2019