High-entropy dual functions over finite fields and locally decodable codes

DOI10.1017/FMS.2021.1MaRDI QIDQ4965879zbMATH OpenOpenAlexFDO

Authors Jop Briët, Farrokh Labib

Publication date 10 March 2021

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2010.14956

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Recommendations

• On higher-order Fourier analysis over non-prime fields
• Highly nonlinear functions over finite fields
• The uncertainty principle over finite fields
• Local decoding and testing of polynomials over grids
• Hard functions for low-degree polynomials over prime fields

Cites work

• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• 3-query locally decodable codes of subexponential length
• A density version of the Hales-Jewett theorem
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• Designing programs that check their work
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• Gaussian width bounds with applications to arithmetic progressions in random settings
• Locally decodable codes
• Locally decodable codes and the failure of cotype for projective tensor products
• On Szemerédi's theorem with differences from a random set
• On divisors of Lucas and Lehmer numbers
• On the Locality of Codeword Symbols
• On the efficiency of local decoding procedures for error-correcting codes
• Outlaw distributions and locally decodable codes
• Private information retrieval
• Probabilistic checking of proofs
• Proof verification and the hardness of approximation problems
• Random differences in Szemerédi's theorem and related results
• Random sequences and pointwise convergence of multiple ergodic averages
• Some open problems on multiple ergodic averages
• The inverse conjecture for the Gowers norm over finite fields in low characteristic
• The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
• Towards 3-query locally decodable codes of subexponential length

Cited in

(1)

• Multiple correlation sequences not approximable by nilsequences

This page was built for publication: High-entropy dual functions over finite fields and locally decodable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965879)