High-rate codes with sublinear-time decoding
暂无分享,去创建一个
[1] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[2] Prasad Raghavendra,et al. A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[3] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[4] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[5] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[6] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[7] Jaikumar Radhakrishnan,et al. Better lower bounds for locally decodable codes , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[8] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[9] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[10] Zeev Dvir. On Matrix Rigidity and Locally Self-correctable Codes , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[11] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[12] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[13] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..
[14] Madhu Sudan,et al. Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms , 2001, AAECC.
[15] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[16] 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.
[17] Venkatesan Guruswami,et al. Optimal Rate List Decoding via Derivative Codes , 2011, APPROX-RANDOM.
[18] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[19] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[20] Zeev Dvir,et al. Matching Vector Codes , 2010, FOCS.
[21] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[22] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[23] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[24] David P. Woodruff,et al. A geometric approach to information-theoretic private information retrieval , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[25] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[26] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[27] Venkatesan Guruswami,et al. "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[28] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[29] Madhu Sudan,et al. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[30] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..
[31] Tadao Kasami,et al. New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.
[32] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[33] Tao Feng,et al. Query-Efficient Locally Decodable Codes of Subexponential Length , 2010, computational complexity.
[34] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[35] Yasuhiro Suzuki,et al. Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length , 2008, IEICE Trans. Inf. Syst..
[36] Chaoping Xing,et al. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound , 2003, IEEE Transactions on Information Theory.
[37] Kenji Obata,et al. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.
[38] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[39] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[40] Madhu Sudan,et al. Improved lower bound on the size of Kakeya sets over finite fields , 2008, 0808.2499.
[41] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[42] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[43] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[44] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.