Sciweavers

33 search results - page 1 / 7
» Tolerant Linearity Testing and Locally Testable Codes
Sort
View
PROPERTYTESTING
2010
13 years 2 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
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...
Swastik Kopparty, Shubhangi Saraf
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
13 years 11 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
RSA
2006
74views more  RSA 2006»
13 years 4 months ago
Robust locally testable codes and products of codes
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 ...
Eli Ben-Sasson, Madhu Sudan
ECCC
2010
91views more  ECCC 2010»
13 years 4 months ago
Limits on the rate of locally testable affine-invariant codes
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...
Eli Ben-Sasson, Madhu Sudan
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
13 years 10 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra