High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract)

Authors Jop Briët, Farrokh Labib

Thumbnail PDF


  • Filesize: 252 kB
  • 2 pages

Document Identifiers

Author Details

Jop Briët
  • CWI, Science Park 123, 1098 XG Amsterdam, The Netherlands
Farrokh Labib
  • CWI, Science Park 123, 1098 XG Amsterdam, The Netherlands

Cite AsGet BibTex

Jop Briët and Farrokh Labib. High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract). In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 76:1-76:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Locally decodable codes (LDCs) allow any single encoded message symbol to be retrieved from a codeword with good probability by reading only a tiny number of codeword symbols, even if the codeword is partially corrupted. LDCs have surprisingly many applications in computer science and mathematics (we refer to [Yekhanin, 2012; Lovett, 2007] for extensive surveys). But despite their ubiquity, they are poorly understood. Of particular interest is the tradeoff between the codeword length N as a function of message length k when the query complexity - the number of probed codeword symbols - and alphabet size are constant. The Hadamard code is a 2-query LDC of length N = 2^O(k) and this length is optimal in the 2-query regime [Lovett, 2007]. For q ≥ 3, near-exponential gaps persist between the best-known upper and lower bounds. The family of Reed-Muller codes, which generalize the Hadamard code, were for a long time the best-known examples, giving q-query LDCs of length exp(O(k^{1/(q-1)})), until breakthrough constructions of matching vector LDCs of Yekhanin and Efremenko [Yekhanin, 2008; Efremenko, 2012]. In contrast with other combinatorial objects such as expander graphs, the probabilistic method has so far not been successfully used to beat the best explicit LDC constructions. In [Lovett, 2007], a probabilistic framework was given that could in principle yield best-possible LDCs, albeit non-constructively. A special instance of this framework connects LDCs with a probabilistic version of Szemerédi’s theorem. The setup for this is as follows: For a finite abelian group G of size N = |G|, let D ⊆ G be a random subset where each element is present with probability ρ independently of all others. For k ≥ 3 and ε ∈ (0,1), let E be the event that every subset A ⊆ G of size |A| ≥ ε |G| contains a proper k-term arithmetic progression with common difference in D. For fixed ε > 0 and sufficiently large N, it is an open problem to determine the smallest value of ρ - denoted ρ_k - such that Pr[E] ≥ 1/2. In [Lovett, 2007] it is shown that there exist k-query LDCs of message length Ω(ρ_k N) and codeword length O(N). As such, Szemerédi’s theorem with random differences, in particular lower bounds on ρ_k, can be used to show the existence of LDCs. Conversely, this connection indirectly implies the best-known upper bounds on ρ_k for all k ≥ 3 [Lovett, 2007; Lovett, 2007]. However, a conjecture from [Lovett, 2007] states that over ℤ_N we have ρ_k ≤ O_k(N^{-1}log N) for all k, which would be best-possible. Truth of this conjecture would imply that over this group, Szemerédi’s theorem with random differences cannot give LDCs better than the Hadamard code. For finite fields, Altman [Lovett, 2007] showed that this is false. In particular, over 𝔽_pⁿ for p odd, he proved that ρ₃ ≥ Ω(p^{-n} n²); generally, ρ_k ≥ Ω(p^{-n} n^{k-1}) holds when p ≥ k+1 [Lovett, 2007]. In turn, these bounds are conjectured to be optimal for the finite-field setting, which would imply that over finite fields, Szemerédi’s theorem with random differences cannot give LDCs better than Reed-Muller codes. The finite-field conjecture is motivated mainly by the possibility that so-called dual functions can be approximated well by polynomial phases, functions of the form e^{2π i P(x)/p} where P is a multivariate polynomial over 𝔽_p. We show that this is false. Using Yekhanin’s matching-vector-code construction, we give dual functions of order k over 𝔽_pⁿ that cannot be approximated in L_∞-distance by polynomial phases of degree k-1. This answers in the negative a natural finite-field analog of a problem of Frantzikinakis over ℕ [Lovett, 2007].

Subject Classification

ACM Subject Classification
  • Theory of computation
  • Higher-order Fourier analysis
  • dual functions
  • finite fields
  • additive combinatorics
  • coding theory


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Daniel Altman. On Szemerédi’s theorem with differences from a random set. Acta Arith, 195:97-108, 2020. URL: https://doi.org/10.4064/aa190531-25-10.
  2. Jop Briët. Subspaces of tensors with high analytic rank. Online Journal of Analytic Combinatorics, 2020. To appear. Available at arXiv: 1908.04169. Google Scholar
  3. Jop Briët, Zeev Dvir, and Sivakanth Gopi. Outlaw distributions and locally decodable codes. Theory of Computing, 15(12):1-24, 2019. Preliminary version in ITCS'17. URL: https://doi.org/10.4086/toc.2019.v015a012.
  4. Jop Briët and Sivakanth Gopi. Gaussian width bounds with applications to arithmetic progressions in random settings. International Mathematics Research Notices, page rny238, 2018. URL: https://doi.org/10.1093/imrn/rny238.
  5. Jop Briët and Farrokh Labib. High-entropy dual functions over finite fields and locally decodable codes. arXiv preprint, 2020. URL: http://arxiv.org/abs/2010.14956.
  6. Klim Efremenko. 3-Query locally decodable codes of subexponential length. SIAM J. Comput., 41(6):1694-1703, 2012. Preliminary version in STOC'09. URL: https://doi.org/10.1137/090772721.
  7. Nikos Frantzikinakis. Some open problems on multiple ergodic averages. Bull. Hellenic Math. Soc., 60:41-90, 2016. URL: https://doi.org/10.1109/tac.2015.2392613.
  8. Nikos Frantzikinakis, Emmanuel Lesigne, and Mate Wierdl. Random sequences and pointwise convergence of multiple ergodic averages. Indiana Univ. Math. J., pages 585-617, 2012. Google Scholar
  9. Nikos Frantzikinakis, Emmanuel Lesigne, and Mate Wierdl. Random differences in Szemerédi’s theorem and related results. J. Anal. Math., 130:91-133, 2016. URL: https://doi.org/10.1007/s11854-016-0030-z.
  10. Sivakanth Gopi. Locality in coding theory. PhD thesis, Princeton University, 2018. Google Scholar
  11. Iordanis Kerenidis and Ronald de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. System Sci., 69(3):395-420, 2004. Earlier version in STOC'03. URL: https://doi.org/10.1016/j.jcss.2004.04.007.
  12. Sergey Yekhanin. Towards 3-query locally decodable codes of subexponential length. J. ACM, 55(1):1:1-1:16, 2008. Preliminary version in STOC'07. URL: https://doi.org/10.1145/1326554.1326555.
  13. Sergey Yekhanin. Locally decodable codes. Found. Trends Theor. Comput. Sci., 6(3):139-255, 2012. URL: https://doi.org/10.1561/0400000030.