Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Moz·2022-07-25·via math.CO updates on arXiv.org
An explicit construction of locally testable codes of constant rate, constant distance and constant number of queries is given. Hence answering affirmatively the $c^3$-problem.