New Lower Bounds for General Locally Decodable Codes
暂无分享,去创建一个
[1] D. Spielman,et al. Expander codes , 1996 .
[2] Reinhard Diestel,et al. Graph Theory , 1997 .
[3] Ashwin Nayak,et al. Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[5] T. Itoh. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[6] Jaikumar Radhakrishnan,et al. Better lower bounds for locally decodable codes , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[7] Yuval Ishai,et al. Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[8] Kenji Obata,et al. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.
[9] Ronald de Wolf,et al. Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.
[10] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[11] Zeev Dvir,et al. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.
[12] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[13] David P. Woodruff,et al. A geometric approach to information-theoretic private information retrieval , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[14] A. Razborov,et al. An Ω ( n 1 / 3 ) Lower Bound for Bilinear Group Based Private Information Retrieval , 2006 .
[15] Sergey Yekhanin,et al. Locally Decodable Codes and Private Information Retrieval Schemes , 2010, Information Security and Cryptography.
[16] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2006, computational complexity.
[17] Alexander A. Razborov,et al. An \Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[18] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.