High-entropy dual functions over finite fields and locally decodable codes
暂无分享,去创建一个
[1] Jop Briët,et al. Gaussian width bounds with applications to arithmetic progressions in random settings , 2017, ArXiv.
[2] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[3] Klim Efremenko. 3-Query Locally Decodable Codes of Subexponential Length , 2012, SIAM J. Comput..
[4] H. Furstenberg,et al. A density version of the Hales-Jewett theorem , 1991 .
[5] Daniel Altman. On Szemerédi’s theorem with differences from a random set , 2019, Acta Arithmetica.
[6] V. Milman,et al. Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .
[7] JOP BRIËT,et al. Multiple correlation sequences not approximable by nilsequences , 2021, Ergodic Theory and Dynamical Systems.
[8] Terence Tao,et al. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle , 2008, 0810.5527.
[9] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[10] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[11] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[12] C. Pomerance,et al. On a problem of Arnold: The average multiplicative order of a given integer , 2011, 1108.5209.
[13] J. Briët. Subspaces of tensors with high analytic rank , 2019 .
[14] Assaf Naor,et al. Locally decodable codes and the failure of cotype for projective tensor products , 2012, ArXiv.
[15] N. Frantzikinakis. Some open problems on multiple ergodic averages , 2011, 1103.3808.
[16] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[17] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[18] Shubhangi Saraf,et al. Locally Decodable Codes , 2016, Encyclopedia of Algorithms.
[19] Ben Green,et al. AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.
[20] Ben Green,et al. An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement) , 2010, 1009.3998.
[21] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[22] Terence Tao,et al. The Inverse Conjecture for the Gowers Norm over Finite Fields in Low Characteristic , 2011, 1101.1469.
[23] Sivakanth Gopi,et al. Locality in coding theory , 2018 .
[24] Nikos Frantzikinakis,et al. Random Sequences and Pointwise Convergence of Multiple Ergodic Averages , 2010, 1012.1130.
[25] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[26] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[27] Nikos Frantzikinakis,et al. Random differences in Szemerédi’s theorem and related results , 2016 .
[28] Prasad Raghavendra,et al. A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[29] J. S. Gage. The great Internet Mersenne prime search. , 1998, M.D. computing : computers in medical practice.
[30] Zeev Dvir,et al. Outlaw Distributions and Locally Decodable Codes , 2016, ITCS.
[31] Alexander Lubotzky,et al. Good cyclic codes and the uncertainty principle , 2017, L’Enseignement Mathématique.
[32] C.L.Stewart. On divisors of Lucas and Lehmer numbers , 2010, 1008.1274.
[33] W. T. Gowers,et al. Decompositions, approximate structure, transference, and the Hahn–Banach theorem , 2008, 0811.3103.
[34] Terence Tao,et al. An inverse theorem for the Gowers U^{s+1}[N]-norm , 2010 .