2026-07-20T05:06:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1697 2024-03-06T11:08:14Z ddc:004 open_access

Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) Kaufman, Tali Litsyn, Simon Xie, Ning Linearity test Fourier analysis coding theory For Boolean functions that are $epsilon$-far from the set of linear functions, we study the lower bound on the rejection probability (denoted by $extsc{rej}(epsilon)$) 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 $extsc{rej}(epsilon)$ were obtained by Bellare, Coppersmith, H{{a}}stad, Kiwi and Sudan. They used Fourier analysis to show that $ extsc{rej}(epsilon) geq e$ for every $0 leq epsilon leq frac{1}{2}$. They also conjectured that this bound might not be tight for $epsilon$'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 $ extsc{rej}(epsilon) geq epsilon$ by an additive constant that depends only on $epsilon$: $extsc{rej}(epsilon) geq epsilon + min {1376epsilon^{3}(1-2epsilon)^{12}, frac{1}{4}epsilon(1-2epsilon)^{4}}$, for every $0 leq epsilon leq frac{1}{2}$. Our analysis is based on a relationship between $extsc{rej}(epsilon)$ 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Tali Kaufman and Simon Litsyn and Ning Xie 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8341, Sublinear Algorithms (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08341.3 urn:nbn:de:0030-drops-16971 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08341.3 eng https://creativecommons.org/licenses/by/4.0/legalcode