7 search results - page 1 / 2 » Symmetric LDPC codes are not necessarily locally testable |
ECCC
2010
14 years 6 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
APPROX
2005
Springer
15 years 3 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...
APPROX
2006
Springer
15 years 1 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...
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
COCO
2009
Springer
15 years 4 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...