Tensor Products of Weakly Smooth Codes Are Robust

: 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 robustly testable tensor products. In particular, we show that all unique-neighbor expander codes and all locally correctable codes, when tensored with any other good-distance code, are robustly testable and hence can be used to construct locally testable codes. Previous work by Dinur et al. (2006) required stronger expansion properties to obtain locally testable codes. Our proofs follow by defining the notion of weakly smooth codes that generalize the smooth codes of Dinur et al. We show that weakly smooth codes are sufficient for constructing robustly testable tensor codes. Using the weaker definition, we are able to expand the family of base codes to include the aforementioned ones. ACM Classification: E.4 AMS Classification: 68Q99 Key words and phrases: Linear code, tensor code, expander code

• Type: Conference
• Year: 2008
• Where: APPROX
• Authors: Eli Ben-Sasson, Michael Viderman
• Keywords: Algorithms, APPROX 2008, Robustly Testable Tensor, Testable, Testable Codes