Pages that link to "Item:Q3088191"

The following pages link to Short Locally Testable Codes and Proofs (Q3088191):

Displaying 10 items.

• The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
• On the rectangle method in proofs of robustness of tensor products (Q437691) (← links)
• Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
• Testing algebraic geometric codes (Q1047829) (← links)
• General constructions for information-theoretic private information retrieval (Q2485285) (← links)
• Locally Decodable Codes for Edit Distance (Q2947534) (← links)
• Short Locally Testable Codes and Proofs (Q3088191) (← 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)
• A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)