The following pages link to Testing Reed–Muller Codes (Q3546491):
Displayed 36 items.
- Local correction of juntas (Q437678) (← links)
- An improved test of Boolean functions for \(k\)-dimensionality (Q465929) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Quantum Locally Testable Codes (Q3449558) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- The Program of the Mini-Workshop (Q4933360) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- (Q4993289) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- (Q5002642) (← links)
- (Q5009557) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- Testing Linear-Invariant Properties (Q5096106) (← links)
- (Q5121896) (← links)
- (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- Direct Sum Testing (Q5348457) (← links)
- (Q5743465) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Almost Optimal Testers for Concise Representations. (Q6084348) (← links)