Locally Decodable Quantum Codes
暂无分享,去创建一个
[1] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[2] 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..
[3] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[4] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[5] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[6] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[8] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[9] Andris Ambainis,et al. Dense quantum coding and quantum finite automata , 2002, JACM.
[10] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[11] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..
[12] 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).
[13] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.