7 search results - page 1 / 2 » Symmetric LDPC Codes and Local Testing |
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
ECCC
2010
13 years 1 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
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...
TCOM
2010
13 years 2 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
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...