Using higher-order Fourier analysis over general fields

  title={Using higher-order Fourier analysis over general fields},
  author={Arnab Bhattacharyya and Abhishek Bhowmick},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis to analyze functions over general fields. Using these new tools, we revisit the results in the above areas. (i) For any fixed finite field K, we show that the list decoding radius of the generalized Reed Muller code over K equals the minimum distance of the… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 68 references

A characterization of locally testable affine-invariant properties via decomposition theorems

Yuichi Yoshida
In Proc. 46th Annual ACM Symposium on the Theory of Computing, • 2014

List decoding Reed-Muller codes over small fields

Electronic Colloquium on Computational Complexity • 2014

Polynomial decompositions in polynomial time

Electronic Colloquium on Computational Complexity • 2014

Estimating the Distance from Testable Affine-Invariant Properties

2013 IEEE 54th Annual Symposium on Foundations of Computer Science • 2013

An inverse theorem for the Gowers U s+1norm

Ben Green, Terence Tao, Tamar Ziegler
Ann. of Math., • 2012

Similar Papers

Loading similar papers…