2-Transitivity is Insufficient for Local Testability

Elena Grigorescu, Tali Kaufman, Madhu Sudan
2012 Computational Complexity  
A basic goal in Property Testing is to identify a minimal set of features that make a property testable. For the case when the property to be tested is membership in a binary linear error-correcting code, Alon et al. [2] had conjectured that the presence of a single low weight code in the dual, and "2-transitivity" of the code (i.e., the code is invariant under a 2-transitive group of permutations on the coordinates of the code) suffice to get local testability. We refute this conjecture by
more » ... ng a family of error correcting codes where the coordinates of the codewords form a large field of characteristic two, and the code is invariant under affine transformations of the domain. This class of properties was introduced by Kaufman and Sudan [13] as a setting where many results in algebraic property testing generalize. Our result shows a complementary virtue: this family also can be useful in producing counterexamples to natural conjectures.
doi:10.1007/s00037-012-0055-3 fatcat:rawo37tevje7thtiogoaagrjey