Breaking the ε-Soundness Bound of the Linearity Test over GF(2)

Tali Kaufman, Simon Litsyn, Ning Xie

Research output: Contribution to journalConference articlepeer-review


For Boolean functions that are ε-far from the set of linear functions, we study the lower bound on the rejection probability (denoted by rej(ε)) of the linearity test suggested by Blum, Luby and Rubinfeld. This problem is arguably the most fundamental and extensively studied problem in property testing of Boolean functions. The previously best bounds for rej(ε) were obtained by Bellare, Coppersmith, Håstad, Kiwi and Sudan. They used Fourier analysis to show that rej(ε) ≥ ε for every 0 ≤ ε ≤ 1/2. They also conjectured that this bound might not be tight for ε’s which are close to 1/2. In this paper we show that this indeed is the case. Specifically, we improve the lower bound of rej(ε) ≥ ε by an additive constant that depends only on ε: rej(ε) ≥ ε + min{1376ε3(1 − 2ε)12, 1/4 ε(1 − 2ε)4}, for every 0 ≤ ε ≤ 1/2. Our analysis is based on a relationship between rej(ε) and the weight distribution of a coset of the Hadamard code. We use both Fourier analysis and coding theory tools to estimate this weight distribution.

Original languageEnglish
JournalDagstuhl Seminar Proceedings
StatePublished - 2008
Externally publishedYes
EventSublinear Algorithms 2008 - Wadern, Germany
Duration: 17 Aug 200822 Aug 2008

Bibliographical note

Publisher Copyright:
© 2008 Dagstuhl Seminar Proceedings. All rights reserved.


Dive into the research topics of 'Breaking the ε-Soundness Bound of the Linearity Test over GF(2)'. Together they form a unique fingerprint.

Cite this