We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is, we consider LTCs over a nite eld F, with codeword testers that only use tests of the form avi + bvj = c, where v is the tested word and a, b, c ∈ F. We show that such LTCs, with high minimal distance, must be of constant size. Speci cally, we show that every 2-query LT...