13 research outputs found
Lower bounds for constant query affine-invariant LCCs and LTCs
Affine-invariant codes are codes whose coordinates form a vector space over a
finite field and which are invariant under affine transformations of the
coordinate space. They form a natural, well-studied class of codes; they
include popular codes such as Reed-Muller and Reed-Solomon. A particularly
appealing feature of affine-invariant codes is that they seem well-suited to
admit local correctors and testers.
In this work, we give lower bounds on the length of locally correctable and
locally testable affine-invariant codes with constant query complexity. We show
that if a code is an -query
locally correctable code (LCC), where is a finite field and
is a finite alphabet, then the number of codewords in is
at most . Also, we show that if
is an -query locally testable
code (LTC), then the number of codewords in is at most
. The dependence on in these
bounds is tight for constant-query LCCs/LTCs, since Guo, Kopparty and Sudan
(ITCS `13) construct affine-invariant codes via lifting that have the same
asymptotic tradeoffs. Note that our result holds for non-linear codes, whereas
previously, Ben-Sasson and Sudan (RANDOM `11) assumed linearity to derive
similar results.
Our analysis uses higher-order Fourier analysis. In particular, we show that
the codewords corresponding to an affine-invariant LCC/LTC must be far from
each other with respect to Gowers norm of an appropriate order. This then
allows us to bound the number of codewords, using known decomposition theorems
which approximate any bounded function in terms of a finite number of
low-degree non-classical polynomials, upto a small error in the Gowers norm
Improved rank bounds for design matrices and a new proof of Kelly's theorem
We study the rank of complex sparse matrices in which the supports of
different columns have small intersections. The rank of these matrices, called
design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in
which they were used to answer questions regarding point configurations. In
this work we derive near-optimal rank bounds for these matrices and use them to
obtain asymptotically tight bounds in many of the geometric applications. As a
consequence of our improved analysis, we also obtain a new, linear algebraic,
proof of Kelly's theorem, which is the complex analog of the Sylvester-Gallai
theorem
On the number of rich lines in truly high dimensional sets
We prove a new upper bound on the number of -rich lines (lines with at
least points) in a `truly' -dimensional configuration of points
. More formally, we show that, if the number
of -rich lines is significantly larger than then there must exist
a large subset of the points contained in a hyperplane. We conjecture that the
factor can be replaced with a tight . If true, this would
generalize the classic Szemer\'edi-Trotter theorem which gives a bound of
on the number of -rich lines in a planar configuration. This
conjecture was shown to hold in in the seminal work of Guth and
Katz \cite{GK10} and was also recently proved over (under some
additional restrictions) \cite{SS14}. For the special case of arithmetic
progressions ( collinear points that are evenly distanced) we give a bound
that is tight up to low order terms, showing that a -dimensional grid
achieves the largest number of -term progressions.
The main ingredient in the proof is a new method to find a low degree
polynomial that vanishes on many of the rich lines. Unlike previous
applications of the polynomial method, we do not find this polynomial by
interpolation. The starting observation is that the degree Veronese
embedding takes -collinear points to linearly dependent images. Hence,
each collinear -tuple of points, gives us a dependent -tuple of images.
We then use the design-matrix method of \cite{BDWY12} to convert these 'local'
linear dependencies into a global one, showing that all the images lie in a
hyperplane. This then translates into a low degree polynomial vanishing on the
original set
On Embeddings of l_1^k from Locally Decodable Codes
We show that any -query locally decodable code (LDC) gives a copy of
with small distortion in the Banach space of -linear forms on
, provided and where , , and the distortion are simple functions of the code
parameters. We exhibit the copy of by constructing a basis for it
directly from "smooth" LDC decoders. Based on this, we give alternative proofs
for known lower bounds on the length of 2-query LDCs. Using similar techniques,
we reprove known lower bounds for larger . We also discuss the relation with
an alternative proof, due to Pisier, of a result of Naor, Regev, and the author
on cotype properties of projective tensor products of spaces
Approximate algebraic structure
We discuss a selection of recent developments in arithmetic combinatorics
having to do with ``approximate algebraic structure'' together with some of
their applications.Comment: 25 pages. Submitted to Proceedings of the ICM 2014. This version may
be longer than the published one, as my submission was 4 pages too long with
the official style fil
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
A (q, k, t)-design matrix is an m × 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 − ( ) 2 qtn 2k 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) ar