Towards lower bounds on locally testable codes via density arguments
From MaRDI portal
(Redirected from Publication:693000)
Recommendations
Cites work
- scientific article; zbMATH DE number 2019623 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- A Parallel Repetition Theorem
- A quadratic lower bound for three-query linear locally decodable codes over any field
- Algebraic property testing: the role of invariance
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Bounds on 2-query locally testable codes with affine tests
- Bounds on \(2\)-query codeword testing
- Bounds on locally testable codes with unique tests
- Clustering in the Boolean hypercube in a list decoding regime
- Combinatorial construction of locally testable codes
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- High-rate codes with sublinear-time decoding
- Limitation on the Rate of Families of Locally Testable Codes
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Locally Testable Codes Require Redundant Testers
- Locally Testable Cyclic Codes
- Locally testable codes and PCPs of almost-linear length
- Locally testable vs. locally decodable codes
- Low Rate Is Insufficient for Local Testability
- Lower bounds for linear locally decodable codes and private information retrieval
- Monotone expanders: constructions and applications
- New direct-product testers and 2-query PCPs
- On 2-Query Codeword Testing with Near-Perfect Completeness
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Short PCPs with Polylog Query Complexity
- Some 3CNF Properties Are Hard to Test
- Symmetric LDPC codes and local testing
- Testing Reed–Muller Codes
- The PCP theorem by gap amplification
- Towards lower bounds on locally testable codes via density arguments
Cited in
(10)- Locally Testable Codes Require Redundant Testers
- Towards lower bounds on locally testable codes via density arguments
- On coset leader graphs of structured linear codes
- On matrix rigidity and locally self-correctable codes
- Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Locally testable codes with constant rate, distance, and locality
- Locally testable codes and PCPs of almost-linear length
- Dense locally testable codes cannot have constant rate and distance
- Limitation on the Rate of Families of Locally Testable Codes
This page was built for publication: Towards lower bounds on locally testable codes via density arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693000)
