On 2-Query Codeword Testing with Near-Perfect Completeness

DOI10.1007/11940128_28zbMath1135.68441OpenAlexW1500846071MaRDI QIDQ5459122

Venkatesan Guruswami

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Bounds on 2-query locally testable codes with affine tests ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Limitation on the Rate of Families of Locally Testable Codes

This page was built for publication: On 2-Query Codeword Testing with Near-Perfect Completeness