High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
暂无分享,去创建一个
Or Meir | Shubhangi Saraf | Swastik Kopparty | Noga Ron-Zewi | Swastik Kopparty | Shubhangi Saraf | Or Meir | Noga Ron-Zewi
[1] Eli Ben-Sasson,et al. Tensor Products of Weakly Smooth Codes are Robust , 2008, Theory Comput..
[2] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[3] Michael Viderman. Strong LTCs with Inverse Poly-Log Rate and Constant Soundness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[4] Oded Goldreich,et al. Bravely, Moderately: A Common Theme in Four Recent Works , 2011, Studies in Complexity and Cryptography.
[5] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[6] Michael Viderman. A Combination of Testability and Decodability by Tensor Products , 2012, APPROX-RANDOM.
[7] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[8] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[9] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[10] E. Gilbert. A comparison of signalling alphabets , 1952 .
[11] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[12] J. Dodziuk. Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .
[13] Richard C. Singleton,et al. Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.
[14] Prasad Raghavendra,et al. A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[15] Luca Trevisan,et al. List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[16] Oded Goldreich,et al. A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem , 1997, SIAM J. Comput..
[17] Sergey Yekhanin,et al. Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.
[18] Venkatesan Guruswami,et al. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.
[19] Noga Alon,et al. A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.
[20] Yehuda Lindell. Introduction to Coding Theory Lecture Notes , 2009 .
[21] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[22] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[23] Rafail Ostrovsky,et al. Local correctability of expander codes , 2013, Inf. Comput..
[24] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[25] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[26] Irit Dinur,et al. Dense Locally Testable Codes Cannot Have Constant Rate and Distance , 2010, APPROX-RANDOM.
[27] Eli Ben-Sasson,et al. Composition of semi-LTCs by two-wise tensor products , 2009, computational complexity.
[28] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[29] Sergey Yekhanin,et al. Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers , 2009, SIAM J. Comput..
[30] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[31] Michael Viderman,et al. Strong LTCs with Inverse Polylogarithmic Rate and Soundness , 2013, 2013 IEEE Conference on Computational Complexity.
[32] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[33] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[34] Eli Ben-Sasson,et al. Composition of Semi-LTCs by Two-Wise Tensor Products , 2009, APPROX-RANDOM.
[35] Atri Rudra,et al. On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..
[36] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[37] Klim Efremenko. 3-Query Locally Decodable Codes of Subexponential Length , 2012, SIAM J. Comput..
[38] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[39] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[40] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[41] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[42] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[43] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[44] Or Meir,et al. On the rectangle method in proofs of robustness of tensor products , 2012, Inf. Process. Lett..
[45] Eli Ben-Sasson,et al. Towards lower bounds on locally testable codes via density arguments , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[46] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.
[47] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..
[48] Or Meir. Combinatorial Construction of Locally Testable Codes , 2009, SIAM J. Comput..
[49] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[50] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[51] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[52] Or Meir,et al. High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity , 2017, J. ACM.
[53] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[54] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[55] Or Meir,et al. High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity , 2015, Electron. Colloquium Comput. Complex..
[56] Or Meir,et al. The tensor product of two good codes is not necessarily robustly testable , 2012, Inf. Process. Lett..
[57] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..
[58] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[59] Michael Viderman,et al. Strong LTCs with Inverse Poly-Log Rate and Constant Soundness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[60] Or Meir,et al. Locally Correctable and Testable Codes Approaching the Singleton Bound , 2014, Electron. Colloquium Comput. Complex..
[61] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[62] Michael Viderman,et al. A Note on high-rate Locally Testable Codes with sublinear query complexity , 2010, Electron. Colloquium Comput. Complex..
[63] Eli Ben-Sasson,et al. Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..
[64] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[65] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[66] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[67] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[68] Swastik Kopparty. Some remarks on multiplicity codes , 2013, Discrete Geometry and Algebraic Combinatorics.
[69] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[70] Noam Nisan,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.