3 problems

Let $V$ be a locally correctable code over a field of characteristic zero. Characteristic-zero LCC conjecture. There are no $3$-query locally correctable codes over fields of chara…

Let an $(r,\delta)$-locally correctable code (LCC) be a code in which each coordinate can be recovered, with failure probability at most $\delta$, by querying at most $r$ other coo…

Dvir's conjecture. Such a locally correctable code cannot have dimension $0.99\cdot n$.