Pages that link to "Item:Q3588443"
From MaRDI portal
The following pages link to Locally Testable vs. Locally Decodable Codes (Q3588443):
Displaying 15 items.
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- Locally testable codes and PCPs of almost-linear length (Q3546312) (← links)
- Locally Testable Cyclic Codes (Q3546520) (← links)
- Local Decoding and Testing for Homomorphisms (Q3595384) (← links)
- Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound (Q4575883) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- Locally Testable Codes Require Redundant Testers (Q5390594) (← links)
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits (Q5422493) (← links)
- Robust locally testable codes and products of codes (Q5486320) (← links)
- Locally Decodable Codes (Q5892557) (← links)
- Locally testable codes with constant rate, distance, and locality (Q6083490) (← links)