Derandomizing homomorphism testing in general groups

The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby, and Rubinfeld [J. Comput. System Sci., 47 (1993), pp. 549-595]. We show that for any groups G and F, and any expanding generating set S of G, the natural deramdomized version of the BLR test in which we pick an element x randomly from G and y randomly from 5 and test whether f(x) · f(y) = f(x-y), performs nearly as well (depending of course on the expansion) as the original test. Moreover, we show that the underlying homomorphism can be found by the natural local "belief propagation decoding." We note that the original BLR test uses 2log₂ |G| random bits, whereas the derandomized test uses only (1 + o(1))log₂ |G| random bits. This factor of 2 savings in the randomness complexity translates to a near quadratic savings in the length of the tables in the related locally testable codes (and possibly probabilistically checkable proofs which may use them). Our result is a significant generalization of recent results that either refer to the special case of the groups G = Z _p^m and T = Z_p or are nonconstructive. We use simple combinatorial arguments and the transitivity of Cayley graphs (and this analysis gives optimal results up to constant factors). Previous techniques used the Fourier transform, a method which seems unextendable to general groups (and furthermore gives suboptimal bounds). Finally, we provide a polynomial time (in |G|) construction of a (somewhat) small (|G|^ε) set of expanding generators for every group G, which yield efficient testers of randomness (1 + ε) log |G| for G. This result follows from a simple derandomization of a known probabilistic construction.