Sciweavers

26 search results - page 1 / 6
» Locally Testable Cyclic Codes
Sort
View
FOCS
2003
IEEE
13 years 10 months ago
Locally Testable Cyclic Codes
László Babai, Amir Shpilka, Daniel S...
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
13 years 6 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: 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...
Eli Ben-Sasson, Michael Viderman
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
13 years 10 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
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...
Paul Valiant
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
13 years 11 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, 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