Good Locally Testable Codes
Autor: | Dinur, Irit, Evra, Shai, Livne, Ron, Lubotzky, Alexander, Mozes, Shahar |
---|---|
Rok vydání: | 2022 |
Předmět: | |
Druh dokumentu: | Working Paper |
Popis: | 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. Comment: This is a revision of arxiv.org/2111.04808 that has been adapted to a mathematical audience |
Databáze: | arXiv |
Externí odkaz: |