Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
From MaRDI portal
Publication:3053157
DOI10.1137/080715548zbMath1202.68178MaRDI QIDQ3053157
Tali Kaufman, Ning Xie, Simon N. Litsyn
Publication date: 4 November 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080715548
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
94B25: Combinatorial codes
Related Items
Short Locally Testable Codes and Proofs: A Survey in Two Parts, Unnamed Item, Direct Sum Testing, Fault detection tests for stuck-at faults on parity counter inputs, Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions, Applying cube attacks to stream ciphers in realistic scenarios, A combinatorial characterization of smooth LTCs and applications, Short Locally Testable Codes and Proofs, Breaking the ε-Soundness Bound of the Linearity Test over GF(2)