On Matrix Rigidity and Locally Self-correctable Codes

We describe a new connection between the problem of finding rigid matrices, as posed by Valiant (MFCS 1977 ), and the problem of proving lower bounds for linear locally correctable codes. Our result shows that proving linear lower bounds on locally correctable codes with super-logarithmic query comp...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 20; číslo 2; s. 367 - 388
Hlavný autor:	Dvir, Zeev
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel SP Birkhäuser Verlag Basel 01.06.2011
Predmet:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science Circuit lower bounds F.2.0 locally decodable codes
ISSN:	1016-3328, 1420-8954
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!