Bounds on 2-query codeword testing

DOI10.1007/B11961zbMATH Open1279.94142OpenAlexW4298253479MaRDI QIDQ5900935FDOQ5900935

Authors: Eli Ben-Sasson, Oded Goldreich, Madhu Sudan 

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• On 2-Query Codeword Testing with Near-Perfect Completeness
• Bounds on 2-query locally testable codes with affine tests
• Locally Testable Codes Require Redundant Testers
• scientific article; zbMATH DE number 2019623
• Testing Reed–Muller Codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cited In (9)

• Title not available (Why is that?)
• Towards lower bounds on locally testable codes via density arguments
• Bounds on 2-query locally testable codes with affine tests
• Short locally testable codes and proofs: a survey in two parts
• On 2-Query Codeword Testing with Near-Perfect Completeness
• Local testing of lattices
• Short locally testable codes and proofs
• Limitation on the Rate of Families of Locally Testable Codes
• Dense locally testable codes cannot have constant rate and distance

This page was built for publication: Bounds on \(2\)-query codeword testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900935)