33 search results - page 2 / 7 » Tolerant Linearity Testing and Locally Testable Codes |
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
APPROX
2008
Springer
14 years 26 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...
APPROX
2005
Springer
14 years 4 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
ECCC
2011
13 years 2 months ago
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...