Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DECOMPOSITION THEOREMS:
Reports tagged with Decomposition Theorems:
TR11-084 | 23rd May 2011

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin algorithm can be viewed as an algorithmic analogue of such a decomposition as it ... more >>>

TR13-166 | 28th November 2013
Arnab Bhattacharyya

#### On testing affine-invariant properties

An affine-invariant property over a finite field is a property of functions over F_p^n that is closed under all affine transformations of the domain. This class of properties includes such well-known beasts as low-degree polynomials, polynomials that nontrivially factor, and functions of low spectral norm. The last few years has ... more >>>

TR16-189 | 21st November 2016
Arnab Bhattacharyya, Sivakanth Gopi

#### Lower bounds for 2-query LCCs over large alphabet

A locally correctable code (LCC) is an error correcting code that allows correction of any arbitrary coordinate of a corrupted codeword by querying only a few coordinates.
We show that any zero-error $2$-query locally correctable code $\mathcal{C}: \{0,1\}^k \to \Sigma^n$ that can correct a constant fraction of corrupted symbols must ... more >>>

ISSN 1433-8092 | Imprint