Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1952-1969

  Kedlaya, Kiran S ^a   Yekhanin, Sergey ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Locally decodable codes; Mersenne primes

Indexed keywords

CODEWORD; FINITE FIELDS; LOCALLY-DECODABLE CODES; MERSENNE PRIMES; PRIME FACTORS; QUERY COMPLEXITY; UPPER BOUND;

DECODING; FINITE ELEMENT METHOD; NUMBER THEORY;

SET THEORY;

EID: 78751546228     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070696519     Document Type: Article

References (39)

1. M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, Ann. of Math. (2), 160 (2004), pp. 781-793. (Pubitemid 40447851)
2. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC), 1991, pp. 21-31.
3. A. Beimel, Y. Ishai, and E. Kushilevitz, General constructions for information-theoretic private information retrieval, J. Comput. System Sci., 71 (2005), pp. 213-247. (Pubitemid 40878949)
4. 1/(2k-1)) barrier for information-theoretic private information retrieval, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 261-270.
5. J. Bourgain and M. Chang, A Gauss sum estimate in arbitrary finite fields, C. R. Math. Acad. Sci. Paris, 342 (2006), pp. 643-646. (Pubitemid 43607961)
6. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private information retrieval, J. ACM, 45 (1998), pp. 965-982.
7. C. Cooper and S. Boone, http://www.mersenne.org/32582657.htm.
8. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer-Verlag, New York, 1992.
9. H. Davenport and H. Hasse, Die Nullstellen der Kongruenz Zetafunktion in gewissen zyklischen Fallen, J. Reine Angew. Math., 172 (1935), pp. 151-182.
10. A. Deshpande, R. Jain, T. Kavitha, S. Lokam, and J. Radhakrishnan, Better lower bounds for locally decodable codes, in Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC), 2002, pp. 184-193. (Pubitemid 34691909)
11. p - 1 for a prime p and other expressions, Acta. Arith., 30 (1976), pp. 257-265.
12. K. Ford, F. Luca, and I. Shparlinski, On the Largest Prime Factor of the Mersenne Numbers, preprint, 2007; available online from http://www.arxiv.org/ abs/0704.1327.
13. W. Gasarch, A survey on private information retrieval, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 82 (2004), pp. 72-107.
14. O. Goldreich, Short Locally Testable Codes and Proofs, Report TR05-014, Electronic Colloquium 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 Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC), 2002, pp. 175-183. (Pubitemid 34691908)
16. B. Hemenway and R. Ostrovsky, Public Key Encryption Which Is Simultaneously a Locallydecodable Error-correcting Code, Cryptology ePrint Archive, Report 2007/083.
17. J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, in Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), 2000, pp. 80-86.
18. K. Kedlaya and S. Yekhanin, Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers, in Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), 2008, pp. 175-186.
19. I. Kerenidis and R. de Wolf, Exponential lower bound for 2-query locally decodable codes via a quantum argument, J. Comput. System Sci., 69 (2004), pp. 395-420.
20. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, UK, 1983.
21. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
22. L. Murata and C. Pomerance, On the largest prime factor of a Mersenne number, inNumber Theory, CRM Proc. Lecture Notes 36, AMS, Providence, RI, 2004, pp. 209-218.
23. M. Murty and S. Wong, The ABC conjecture and prime divisors of the Lucas and Lehmer sequences, in Proceedings of the Millennial Conference on Number Theory, III (Urbana, IL, 2000), A. K. Peters, Natick, MA, 2002, pp. 43-54.
24. K. Obata, Optimal lower bounds for 2-query locally decodable linear codes, in Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 2483, Springer-Verlag, Berlin, 2002, pp. 39-50.
25. A. Polishchuk and D. Spielman, Nearly-linear size holographic proofs, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), 1994, pp. 194-203.
26. C. Pomerance, Recent developments in primality testing, Math. Intelligencer, 3 (1980/81), pp. 97-105.
27. P. Raghavendra, A Note on Yekhanin's Locally Decodable Codes, Report TR07-016, Electronic Colloquium on Computational Complexity, 2007.
28. A. Romashchenko, Reliable computations based on locally decodable codes, in Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Comput. Sci. 3884, Springer-Verlag, Berlin, 2006, pp. 537-548. (Pubitemid 43990454)
29. n, Proc. Cambridge Philos. Soc., 58 (1962), pp. 555-562.
30. n, Acta Arith., 26 (1974/75), pp. 427-433.
31. C. Stewart, On divisors of Fermat, Fibonacci, Lucas, and Lehmer numbers, Proc. London Math. Soc. (3), 35 (1977), pp. 425-447.
32. M. Sudan, Efficient Checking of Polynomials and the Hardness of Approximation Problems, Springer-Verlag, New York, 1995.
33. L. Trevisan, Some applications of coding theory in computational complexity, in Complexity of Computations and Proofs, Quad. Mat. 13, Department of Mathematics, Seconda Univ. Napoli, Caserta, Italy, 2004, pp. 347-424.
34. S. Wagstaff, Divisors of Mersenne numbers, Math. Comp., 40 (1983), pp. 385-397.
35. S. Wehner and R. de Wolf, Improved lower bounds for locally decodable codes and private information retrieval, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), Lecture Notes in Comput. Sci. 3580, Springer- Verlag, Berlin, pp. 1424-1436.
36. D. Woodruff, Corruption and recovery-efficient locally decodable codes, in Proceedings of the 12th RANDOM, 2008, pp. 584-595.
37. D. Woodruff, New Lower Bounds for General Locally Decodable Codes, Report TR07-006, Electronic Colloquium on Computational Complexity, 2007.
38. S. Yekhanin, Towards 3-query locally decodable codes of subexponential length, J. ACM, 55 (2008), pp. 1-14.
39. S. Yekhanin, Locally Decodable Codes and Private Information Retrieval Schemes, Ph.D. thesis, MIT, Cambridge, MA, 2007.