High-entropy dual functions over finite fields and locally decodable codes
Jop Bri\"et, Farrokh Labib

TL;DR
This paper demonstrates that for infinitely many primes, certain dual functions over finite fields cannot be closely approximated by lower-degree polynomial phase functions, highlighting limitations in finite-field analogs of classical correlation sequence approximations.
Contribution
It establishes the existence of dual functions over finite fields that defy approximation by polynomial phase functions, answering a key open problem in finite-field harmonic analysis.
Findings
Existence of dual functions not approximable by lower-degree polynomials
Negative answer to a finite-field analog of a problem by Frantzikinakis
Implications for the structure of multiple correlation sequences over finite fields
Abstract
We show that for infinitely many primes , there exist dual functions of order over that cannot be approximated in -distance by polynomial phase functions of degree . This answers in the negative a natural finite-field analog of a problem of Frantzikinakis on -approximations of dual functions over (a.k.a. multiple correlation sequences) by nilsequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
