New extension of the Weil bound for character sums with applications to coding

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 788-796

  Kaufman, Tali ^a   Lovett, Shachar ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

affine invariant codes; character sums; property testing; Weil bound

Indexed keywords

ADDITIVE CHARACTERS; AFFINE INVARIANT; ALGEBRAIC GEOMETRY; ARBITRARY DEGREE; BOUNDED WEIGHTS; CHARACTER SUMS; CONSTANT FUNCTIONS; DUAL DISTANCE; FINITE FIELDS; POLYNOMIAL SIZE; PROPERTY-TESTING; QUASI-POLY-NOMIAL; REED-MULLER; REED-MULLER CODES; SPARSE POLYNOMIALS; THEORETICAL COMPUTER SCIENCE; WEIGHT DISTRIBUTIONS; WEIL BOUNDS;

COMPUTER SCIENCE; FINITE ELEMENT METHOD; OPTIMAL SYSTEMS;

POLYNOMIALS;

EID: 84863300855     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.41     Document Type: Conference Paper

References (15)

1. J. Bourgain, Mordell's exponential sum estimate revisited, J. Amer. Math. Soc., 18(2):477-499 (electronic), 2005.
2. thAnnual IEEE Symposium on Foundations of Computer Science (FOCS '07), pages 41-51, 2007.
3. P. Deligne, Aplications de la formule des traces aux sommes trigonometriques, in SGA 4 1/2 Springer Lecture Notes in Math 569, 1978.
4. Elena Grigorescu, Tali Kaufman and Madhu Sudan, Succinct Representation of Codes with Applications to Testing, manuscript.
5. Ariel Gabizon, Ran Raz, Deterministic extractors for affine sources over large fields, Combinatorica 28(4): 415-440 (2008).
6. Tali Kaufman and Simon Litsyn, Almost Orthogonal Linear Codes are Locally Testable, FOCS 2005: 317-326.
7. Tali Kaufman and Shachar Lovett, The List-Decoding Size of Reed-Muller Codes, ICS 2010.
8. Tali Kaufman and Madhu Sudan, Sparse random linear codes are locally decodeable and testable, FOCS 2007, pp. 590-600.
9. Tali Kaufman and Madhu Sudan, Algebraic Property Testing: The Role of Invariance, Proceedings of the 40th ACM Symposium on Theory of Computing (STOC), 2008.
10. Tali Kaufman, Avi Wigderson, Symmetric LDPC Codes and Local Testing, ICS 2010, 406-421.
11. Swastik Kopparty and Shubhangi Saraf, Local List-Decoding and Testing of Random Linear Codes from High-Error, to appear in the Proceedings of STOC 2010.
12. th annual ACM symposium on Theory of computing (STOC '08), pages 557-562, 2008.
13. Emanuele Viola, The sum d of small-bias generators fools polynomials of degree d, Computational Complexity 18(2):209-217, 2009.
14. A. Weil, Sur les courbes algebriques et les varietes qui s'en deduisent, Actualities Sci. et Ind. no. 1041. Hermann, Paris, 1948.
15. Avi Wigderson, Deterministic Extractors - Lecture Notes, www.math.ias.edu/ avi/TALKS/Pseudorandomness-mini-workshop2009.pdf.