Pages that link to "Item:Q5390594"
From MaRDI portal
The following pages link to Locally Testable Codes Require Redundant Testers (Q5390594):
Displaying 13 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Bounds on locally testable codes with unique tests (Q2826056) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Low Rate Is Insufficient for Local Testability (Q3588425) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900935) (← links)
- GSF-locality is not sufficient for proximity-oblivious testing (Q6115397) (← links)