Abstract
Affine-invariant codes are codes whose coordinates form a vector space over a finite field and which are invariant under affine transformations of the coordinate space. They form a natural, well-studied class of codes; they include popular codes such as Reed-Muller and Reed-Solomon. A particularly appealing feature of affine-invariant codes is that they seem well suited to admit local correctors and testers. In this work, we give lower bounds on the length of locally correctable and locally testable affine-invariant codes with constant query complexity. We show that if a code C ⊂ ΣKn is an r-query affine invariant locally correctable code (LCC), where K is a finite field and Σ is a finite alphabet, then the number of codewords in C is at most exp(OK,r,|Σ|(nr−1)). Also, we show that if C ⊂ ΣKn is an r-query affine invariant locally testable code (LTC), then the number of codewords in C is at most exp(OK,r,|Σ|(nr−2)). The dependence on n in these bounds is tight for constant-query LCCs/LTCs, since Guo, Kopparty, and Sudan (ITCS’13) constructed affine-invariant codes via lifting that have the same asymptotic tradeoffs. Note that our result holds for non-linear codes, whereas previously, Ben-Sasson and Sudan (RANDOM’11) assumed linearity to derive similar results. Our analysis uses higher-order Fourier analysis. In particular, we show that the codewords corresponding to an affine-invariant LCC/LTC must be far from each other with respect to Gowers norm of an appropriate order. This then allows us to bound the number of codewords, using known decomposition theorems, which approximate any bounded function in terms of a finite number of low-degree non-classical polynomials, up to a small error in the Gowers norm.
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3 (1998), 501--555. Google Scholar
Digital Library
- Sanjeev Arora and Shmuel Safra. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 1 (1998), 70--122. Google Scholar
Digital Library
- Boaz Barak, Zeev Dvir, Amir Yehudayoff, and Avi Wigderson. 2011. Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes. ACM, 519--528.Google Scholar
- Omer Barkol, Yuval Ishai, and Enav Weinreb. 2007. On locally decodable codes, self-correctable codes, and t-private PIR. Springer, 311--325. Google Scholar
Digital Library
- Eli Ben-Sasson, Noga Ron-Zewi, and Madhu Sudan. 2012. Sparse affine-invariant linear codes are locally testable. IEEE, 561--570. Google Scholar
Digital Library
- Eli Ben-Sasson and Madhu Sudan. 2004. Robust locally testable codes and products of codes. 286--297.Google Scholar
- Eli Ben-Sasson and Madhu Sudan. 2008. Short PCPs with polylog query complexity. 38, 2 (2008), 551--607.Google Scholar
- Eli Ben-Sasson and Madhu Sudan. 2011. Limits on the rate of locally testable affine-invariant codes. Springer, 412--423. Google Scholar
Cross Ref
- Arnab Bhattacharyya and Abhishek Bhowmick. 2015. Using higher-order Fourier analysis over general fields. Preprint arXiv:1505.00619 (2015).Google Scholar
- Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, and Shubhangi Saraf. 2011. Tight lower bounds for 2-query LCCs over finite fields. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 638--647.Google Scholar
Digital Library
- Abhishek Bhowmick and Shachar Lovett. 2015a. Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. Preprint arXiv:1506.02047 (2015).Google Scholar
- Abhishek Bhowmick and Shachar Lovett. 2015b. The list decoding radius of Reed-Muller codes over small fields. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing. ACM. Google Scholar
Digital Library
- Manuel Blum and Sampath Kannan. 1995. Designing programs that check their work. J. ACM 42, 1 (1995), 269--291. Google Scholar
Digital Library
- Manuel Blum, Michael Luby, and Ronitt Rubinfeld. 1993. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47, 3 (1993), 549--595. Google Scholar
Digital Library
- Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. 1998. Private information retrieval. J. ACM 45, 6 (1998), 965--981. Google Scholar
Digital Library
- Irit Dinur. 2007. The PCP theorem by gap amplification. J. ACM 54, 3 (2007), 12.Google Scholar
Digital Library
- Zeev Dvir, Shubhangi Saraf, and Avi Wigderson. 2014. Breaking the quadratic barrier for 3-LCC’s over the reals. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM, 784--793. Google Scholar
Digital Library
- Zeev Dvir and Amir Shpilka. 2007. Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. 36, 5 (2007), 1404--1434.Google Scholar
- Oded Goldreich, Howard Karloff, Leonard J. Schulman, and Luca Trevisan. 2012. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings of the 17th IEEE Annual Conference on Computational Complexity. IEEE, 175--183.Google Scholar
- Oded Goldreich and Madhu Sudan. 2006. Locally testable codes and PCPs of almost-linear length. J. ACM 53, 4 (July 2006), 558--655. Google Scholar
Digital Library
- William T. Gowers. 2001. A new proof of Szemerédi’s theorem. 11, 3 (2001), 465--588.Google Scholar
- Ben Green. 2006. Montreal lecture notes on quadratic Fourier analysis. Preprint arXiv:math/0604089 (2006).Google Scholar
- Alan Guo, Swastik Kopparty, and Madhu Sudan. 2013. New affine-invariant codes from lifting. ACM, 529--540. Google Scholar
Digital Library
- Alan Xinyu Guo. 2013. Some Closure Features of Locally Testable Affine-invariant Properties. Master’s thesis. Massachusetts Institute of Technology.Google Scholar
- Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, and Carol Wang. 2015. Limitations on testable affine-invariant codes in the high-rate regime. SIAM, 1312--1325. Google Scholar
Cross Ref
- T. Kasami, S. Lin, and W. W. Peterson. 1967. Some results on cyclic codes which are invariant under the affine group and their applications. Inform. and Comput. 11, 5--6 (1967), 475--496.Google Scholar
- Jonathan Katz and Luca Trevisan. 2000. On the efficiency of local decoding procedures for error-correcting codes. ACM, 80--86. Google Scholar
Digital Library
- Tali Kaufman and Madhu Sudan. 2008. Algebraic property testing: The role of invariance. ACM, 403--412.Google Scholar
- Iordanis Kerenidis and Ronald de Wolf. 2003. Exponential lower bound for 2-query locally decodable codes via a quantum argument. ACM, 106--115.Google Scholar
- Richard J. Lipton. 1990. Efficient checking of computations. Springer, 207--215. Google Scholar
Cross Ref
- Or Meir. 2009. Combinatorial construction of locally testable codes. 39, 2 (2009), 491--544.Google Scholar
- Madhu Sudan, Luca Trevisan, and Salil Vadhan. 1999. Pseudorandom generators without the XOR lemma. ACM, 537--546. Google Scholar
Cross Ref
- Terence Tao. 2012. Higher Order Fourier Analysis. Vol. 142. American Mathematical Soc. Google Scholar
Cross Ref
- Terence Tao and Tamar Ziegler. 2012. The inverse conjecture for the Gowers norm over finite fields in low characteristic. 16, 1 (2012), 121--188.Google Scholar
- Madhur Tulsiani and Julia Wolf. 2014. Quadratic Goldreich-Levin theorems. SIAM J. Comput. 43, 2 (2014), 730--766. Google Scholar
- Michael Viderman. 2015. Explicit strong LTCs with inverse poly-log rate and constant soundness. Electronic Colloquium on Computational Complexity (ECCC) 22 (2015), 20.Google Scholar
- David Woodruff. 2007. New lower bounds for general locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), Vol. 14.Google Scholar
- David P. Woodruff. 2012. A quadratic lower bound for three-query linear locally decodable codes over any field. J. Comput. Sci. Technol. 27, 4 (2012), 678--686. Google Scholar
Cross Ref
- Sergey Yekhanin. 2011. Locally decodable codes. In Computer Science--Theory and Applications. Springer, 289--290. Google Scholar
Cross Ref
Index Terms
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
Recommendations
Lower bounds for constant query affine-invariant LCCs and LTCs
CCC '16: Proceedings of the 31st Conference on Computational ComplexityAffine-invariant codes are codes whose coordinates form a vector space over a finite field and which are invariant under affine transformations of the coordinate space. They form a natural, well-studied class of codes; they include popular codes such as ...
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part IWe give a general transformation which turns polynomialsize Frege proofs to subexponential-size AC0-Frege proofs. This indicates that proving exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-...
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation that turns polynomial-size Frege proofs into subexponential-size AC0-Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, as it is a long-standing open problem to prove ...






Comments