Linearity testing in characteristic two
From MaRDI portal
Publication:3129465
DOI10.1109/18.556674zbMath0867.68060OpenAlexW1997855358WikidataQ56959088 ScholiaQ56959088MaRDI QIDQ3129465
Madhu Sudan, Mihir Bellare, Don Coppersmith, Johan T. Håstad, Marcos A. Kiwi
Publication date: 7 August 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/013a660a08ed9db64eb148bfd99e2c637342f8e3
Related Items (39)
Algebraic testing and weight distributions of codes. ⋮ Application of Grover's algorithm to check non-resiliency of a Boolean function ⋮ Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions ⋮ Simple analysis of graph tests for linearity and PCP ⋮ A self-tester for linear functions over the integers with an elementary proof of correctness ⋮ Cube Attack on Stream Ciphers using a Modified Linearity Test ⋮ A query efficient non-adaptive long code test with perfect completeness ⋮ Probabilistic estimation of the algebraic degree of Boolean functions ⋮ Fault detection tests for stuck-at faults on parity counter inputs ⋮ On the distance between non-isomorphic groups. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Active and Passive Testing ⋮ Computing Walsh coefficients from the algebraic normal form of a Boolean function ⋮ Breaking the ε-Soundness Bound of the Linearity Test over GF(2) ⋮ Testing Odd Direct Sums Using High Dimensional Expanders ⋮ Quantum algorithms on Walsh transform and Hamming distance for Boolean functions ⋮ On the structure of Boolean functions with small spectral norm ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ Testing Juntas: A Brief Survey ⋮ Optimal Testing of Reed-Muller Codes ⋮ Some Recent Results on Local Testing of Sparse Linear Codes ⋮ Linear-consistency testing. ⋮ Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions ⋮ Unnamed Item ⋮ No-signaling linear PCPs ⋮ Concatenated kernel codes ⋮ Unnamed Item ⋮ A combinatorial characterization of smooth LTCs and applications ⋮ Testing properties of functions on finite groups ⋮ Characterizations of locally testable linear- and affine-invariant families ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Testing algebraic geometric codes ⋮ Clique is hard to approximate within \(n^{1-\epsilon}\) ⋮ ON THE CAYLEY GRAPHS OF BOOLEAN FUNCTIONS ⋮ On Dinur’s proof of the PCP theorem ⋮ Testing Boolean Functions Properties ⋮ Direct Sum Testing
This page was built for publication: Linearity testing in characteristic two
