18 search results - page 1 / 4 » Sparse Random Linear Codes are Locally Decodable and Testabl... |
PROPERTYTESTING
2010
13 years 2 months ago
2010
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...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
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...