Locally Decodable Codes from nice subsets of finite fields and prime factors of Mersenne numbers

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 175-186

  Kedlaya, Kiran S ^a   Yekhanin, Sergey ^b  

^a Architecture Machine Group

^b IAS ^*

Author keywords

[No Author keywords available]

Indexed keywords

CODE WORDS; FINITE FIELDS; LOCALLY DECODABLE CODES; PRIME FACTORS;

MATHEMATICAL TECHNIQUES;

COMPUTATIONAL COMPLEXITY;

EID: 51749087083     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.7     Document Type: Conference Paper

References (36)

1. M. Agrawal, N. Kayal, and N. Saxena, "PRIMES is in P," Annals of Mathematics, vol. 160, pp. 781-793, 2004.
2. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," In Proc. of the 23th ACM Symposium on Theory of Computing (STOC), pp. 21-31, 1991.
3. A. Beimel, Y. Ishai and E. Kushilevitz, "General constructions for information-theoretic private information retrieval," Journal of Computer and System Sciences, vol. 71, pp. 213-247, 2005. Preliminary versions in STOC 1999 and ICALP 2001.
4. 1/(2k-1)) barrier for information-theoretic private information retrieval," In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 261-270, 2002.
5. J. Bourgain and M. Chang, "A Gauss sum estimate in arbitrary finite fields," Comptes Rendus Mathematique, vol. 342, pp. 643-646, 2006.
6. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, "Private information retrieval," In Proc. of the 36rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 41-50, 1995. Also, in Journal of the ACM, vol. 45, 1998.
7. D. Cox, J. Little, D. O'Shea, Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, 1996.
8. H. Davenport, H. Hasse, "Die Nullstellen der Kongruenz Zetafunktion in gewissen zyklischen Fallen," J. Reine Angew. Math, vol. 172, pp. 151-182, (1935).
9. A. Deshpande, R. Jain, T. Kavitha, S. Lokam and J. Radhakrishnan, "Better lower bounds for locally decodable codes," In Proc. of the 20th IEEE Computational Complexity Conference (CCC), pp. 184-193, 2002.
10. Curtis Cooper, Steven Boone, http://www.mersenne.org/32582657.htm
11. p - 1 for a prime p and other expressions," Acta. Arith. vol. 30, pp. 257-265, 1976.
12. K. Ford, F. Luca and I. Shparlinski, "On the largest prime factor of the Mersenne numbers," a preprint, arXiv:0704.1327, 2007.
13. W. Gasarch, "A survey on private information retrieval," The Bulletin of the EATCS, vol. 82, pp. 72-107, 2004.
14. O. Goldreich, "Short locally testable codes and proofs," Technical Report TR05-014, Electronic Colloquim on Computational Complexity (ECCC), 2005.
15. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan, "Lower bounds for locally decodable codes and private information retrieval," In Proc. of the 17th IEEE Computational Complexity Conference (CCC), pp. 175-183, 2002.
16. B. Hemenway and R. Ostrovsky, "Public key encryption which is simultaneously a locally-decodable error-correcting code," In Cryptology ePrint Archive, Report 2007/083.
17. J. Katz and L. Trevisan, "On the efficiency of local decoding procedures for error-correcting codes," In Proc. of the 32th ACM Symposium on Theory of Computing (STOC), pp. 80-86, 2000.
18. I. Kerenidis and R. de Wolf, "Exponential lower bound for 2-query locally decodable codes via a quantum argument," Journal of Computer and System Sciences, 69(3), pp. 395-420. Earlier version in STOC'03. quant-ph/0208062.
19. R. Lidl and H. Niederreiter, Finite Fields. Cambridge: Cambridge University Press, 1983.
20. L. Murata and C. Pomerance, "On the largest prime factor of a Mersenne number," Number theory, CRM Proc. Lecture Notes of American Mathematical Society vol. 36, pp. 209-218, 2004.
21. M. Murty and S. Wong, "The ABC conjecture and prime divisors of the Lucas and Lehmer sequences," In Proc. of Milennial Conference on Number Theory III, (Urbana, IL, 2000) (A. K. Peters, Natick, MA, 2002) pp. 43-54.
22. K. Obata, "Optimal lower bounds for 2-query locally decodable linear codes," In Proc. of the 6th RANDOM, vol. 2483 of Lecture Notes in Computer Science, pp. 39-50, 2002.
23. A. Polishchuk and D. Spielman, "Nearly-linear size holographic proofs," In Proc. of the 26th ACM Symposium on Theory of Computing (STOC), pp. 194-203, 1994.
24. C. Pomerance, "Recent developments in primality testing," Math. Intelligencer, 3:3, pp. 97-105, (1980/81).
25. P. Raghavendra, "A Note on Yekhanin's locally decodable codes," In Electronic Colloquium on Computational Complexity, Report TR07-016, 2007.
26. A. Romashchenko, "Reliable computations based on locally decodable codes," In Proc. of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 3884 of Lecture Notes in Computer Science, pp. 537-548, 2006.
27. n, "In Proc. of Cambridge Philos. Soc. vol. 58, pp. 555-562, 1962.
28. n," Acta Arith. vol. 26, pp. 427-433, 1974/75.
29. C. Stewart, "On divisors of Fermat, Fibonacci, Lucas, and Lehmer numbers," In Proc. of London Math. Soc. vol. 35 (3), pp. 425-447, 1977.
30. M. Sudan, Efficient checking of polynomials and proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley, 1992.
31. L. Trevisan, "Some applications of coding theory in computational complexity," Quaderni di Matematica, vol. 13, pp. 347-424, 2004.
32. S. Wagstaff, "Divisors of Mersenne numbers," Math. Comp., 40:161, pp. 385-397, 1983.
33. S. Wehner and R. de Wolf, "Improved lower bounds for locally decodable codes and private information retrieval," In Proc. of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), LNCS 3580, pp. 1424-1436.
34. D. Woodruff, "New lower bounds for general locally decodable codes," Electronic Colloquium on Computational Complexity, TR07-006, 2007.
35. S. Yekhanin, "Towards 3-query locally decodable codes of subexponential length," In Proc. of the 39th ACM Symposium on Theory of Computing (STOC), pp. 266-274, 2007.
36. S. Yekhanin, Locally decodable codes and private information retrieval schemes. PhD thesis, MIT, 2007.