10 search results - page 1 / 2 » Tensor Products of Weakly Smooth Codes Are Robust |
APPROX
2008
Springer
13 years 7 months 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
2006
Springer
13 years 8 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...
APPROX
2005
Springer
13 years 10 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...
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 ...
JC
2010
12 years 11 months ago
2010
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...