PROPERTYTESTING
2010
13 years 8 months ago
2010
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 a...
RSA
2006
13 years 10 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
SIAMCOMP
2008
13 years 10 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
ECCC
2010
13 years 11 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
APPROX
2008
Springer
14 years 25 days ago
2008
Springer
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...