Short Locally Testable Codes and Proofs: A Survey in Two Parts

We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to approximately testing large objects based on a very small number of probes, each retrieving a single bit in the representation of the object. This yields super-fast approximate-testing of the corresponding property (i.e., be a codeword or a valid proof). We also review the related concept of local decodable codes. The survey consists of two independent (i.e., self-contained) parts that cover the same material at different levels of rigor and detail. Still, in spite of the repetitions, there may be a benefit in reading both parts.

• Type: Journal
• Year: 2010
• Where: PROPERTYTESTING
• Authors: Oded Goldreich
• Keywords: Local Decodable Codes, PROPERTYTESTING 2010, Testable Codes, Testable Proofs, Theoretical Computer Science