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...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 20; no. 2; pp. 367 - 388
Main Author:	Dvir, Zeev
Format:	Journal Article
Language:	English
Published:	Basel SP Birkhäuser Verlag Basel 01.06.2011
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!