Linearity testing in characteristic two
From MaRDI portal
Recommendations
Cited in
(54)- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
- scientific article; zbMATH DE number 1418270 (Why is no real title available?)
- Low-degree tests at large distances
- Testing Linear-Invariant Properties
- Cube Attack on Stream Ciphers using a Modified Linearity Test
- scientific article; zbMATH DE number 7250157 (Why is no real title available?)
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Optimal unateness testers for real-valued functions: adaptivity helps
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Concatenated kernel codes
- On Dinur’s proof of the PCP theorem
- Control of the bilinear indicator cube testing property
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
- Lower bounds for adaptive linearity tests
- scientific article; zbMATH DE number 7650107 (Why is no real title available?)
- Some recent results on local testing of sparse linear codes
- Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions
- Some 3CNF Properties Are Hard to Test
- Testing Odd Direct Sums Using High Dimensional Expanders
- Linear-consistency testing.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Agreement tests on graphs and hypergraphs
- Simple analysis of graph tests for linearity and PCP
- Direct sum testing
- Probabilistic checking against non-signaling strategies from linearity testing
- A self-tester for linear functions over the integers with an elementary proof of correctness
- Computing Walsh coefficients from the algebraic normal form of a Boolean function
- Probabilistic estimation of the algebraic degree of Boolean functions
- Testing Boolean functions properties
- Fault detection tests for stuck-at faults on parity counter inputs
- Tolerant Linearity Testing and Locally Testable Codes
- Characterizations of locally testable linear- and affine-invariant families
- A combinatorial characterization of smooth LTCs and applications
- On the Cayley graphs of Boolean functions
- No-signaling linear PCPs
- Testing juntas: a brief survey
- On axis-parallel tests for tensor product codes
- On active and passive testing
- Testing properties of functions on finite groups
- Computing linearizations using test sets
- Testing algebraic geometric codes
- Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2)
- A high dimensional Goldreich-Levin theorem
- On approximability of satisfiable k-CSPs. III
- On axis-parallel tests for tensor product codes
- Property testing with online adversaries
- Optimal testing of Reed-Muller codes
- A query efficient non-adaptive long code test with perfect completeness
- Algebraic testing and weight distributions of codes.
- Reducing Testing Affine Spaces to Testing Linearity of Functions
- Testing linear operators
- Two Tests for the Linearity of Sequential Machines
- On the distance between non-isomorphic groups.
- Limitation on the Rate of Families of Locally Testable Codes
This page was built for publication: Linearity testing in characteristic two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129465)
