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...
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...
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
: 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...
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...