16 search results - page 1 / 4 » Limits on the rate of locally testable affine-invariant code... |
ECCC
2010
13 years 5 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...
ECCC
2011
12 years 8 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...
RSA
2006
13 years 4 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 ...
COCO
2009
Springer
13 years 11 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...
PROPERTYTESTING
2010
13 years 2 months ago
2010
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...