Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes

Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Scopus citations

Abstract

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns intersect in at most t rows. We prove that for m ≥ n, the rank of any (q,k,t)-design matrix over a field of characteristic zero (or sufficiently large finite characteristic) is at least n - (qtn/2k)2. Using this result we derive the following applications: Impossibility results for 2-query LCCs over large fields: A 2-query locally correctable code (LCC) is an error correcting code in which every codeword coordinate can be recovered, probabilistically, by reading at most two other code positions. Such codes have numerous applications and constructions (with exponential encoding length) are known over finite fields of small characteristic. We show that infinite families of such linear 2-query LCCs do not exist over fields of characteristic zero or large characteristic regardless of the encoding length. Generalization of known results in combinatorial geometry: We prove a quantitative analog of the Sylvester-Gallai theorem: Let v1,...,vm be a set of points in Cd such that for every i ∈ [m] there exists at least δ m values of j ∈ [m] such that the line through vi,vj contains a third point in the set. We show that the dimension of v 1,...,vm is at most O(1/δ2). Our results generalize to the high-dimensional case (replaceing lines with planes, etc.) and to the case where the points are colored (as in the Motzkin-Rabin Theorem).

Original languageEnglish (US)
Title of host publicationSTOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Pages519-528
Number of pages10
ISBN (Print)9781450306911
DOIs
StatePublished - 2011
Event43rd ACM Symposium on Theory of Computing, STOC 2011 - San Jose, United States
Duration: Jun 6 2011Jun 8 2011

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference43rd ACM Symposium on Theory of Computing, STOC 2011
Country/TerritoryUnited States
CitySan Jose
Period6/6/116/8/11

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Sylvester Gallai
  • matrix rigidity
  • matrix scaling

Fingerprint

Dive into the research topics of 'Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes'. Together they form a unique fingerprint.

Cite this