Lower Bounds for Approximate LDCs
暂无分享,去创建一个
[1] Prasad Raghavendra,et al. A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[2] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[3] Assaf Naor,et al. Locally decodable codes and the failure of cotype for projective tensor products , 2012, ArXiv.
[4] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[5] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[6] Tao Feng,et al. Query-Efficient Locally Decodable Codes of Subexponential Length , 2010, computational complexity.
[7] Yasuhiro Suzuki,et al. Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length , 2008, IEICE Trans. Inf. Syst..
[8] Ryan O'Donnell,et al. Spherical cubes , 2012, Commun. ACM.
[9] Amnon Ta-Shma,et al. Local List Decoding with a Constant Number of Queries , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[10] Sergey Yekhanin,et al. Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers , 2009, SIAM J. Comput..
[11] Avi Wigderson,et al. Fractional Sylvester–Gallai theorems , 2012, Proceedings of the National Academy of Sciences.
[12] Ronald de Wolf,et al. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[13] Zeev Dvir,et al. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.
[14] Avi Wigderson,et al. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM , 2012, Forum of Mathematics, Sigma.
[15] Zeev Dvir,et al. Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[16] Avi Wigderson,et al. Breaking the quadratic barrier for 3-LCC's over the reals , 2013, STOC.
[17] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2006, computational complexity.
[18] Avi Wigderson,et al. Sylvester-Gallai type theorems for approximate collinearity , 2012, Electron. Colloquium Comput. Complex..
[19] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[20] David P. Woodruff. A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, Journal of Computer Science and Technology.
[21] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[22] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[23] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.