Local Correctability of Expander Codes
暂无分享,去创建一个
[1] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[2] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[3] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[4] Alexander Barg,et al. Distance properties of expander codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[5] Tao Feng,et al. Query-Efficient Locally Decodable Codes of Subexponential Length , 2010, computational complexity.
[6] Zeev Dvir,et al. Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[7] E. F. Assmus. POLYNOMIAL CODES AND FINITE GEOMETRIES , 2003 .
[8] Alexander Barg,et al. Concatenated codes: serial and parallel , 2003, IEEE Transactions on Information Theory.
[9] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[10] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[11] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[12] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[13] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[14] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2011, STOC '11.
[15] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[16] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[17] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[18] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[19] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[20] Gilles Zémor,et al. On expander codes , 2001, IEEE Trans. Inf. Theory.
[21] Jennifer D. Key,et al. Designs and their codes , 1992, Cambridge tracts in mathematics.
[22] Yuval Ishai,et al. Share Conversion and Private Information Retrieval , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[23] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[24] D. Spielman,et al. Expander codes , 1996 .
[25] Klim Efremenko,et al. From irreducible representations to locally decodable codes , 2012, STOC '12.
[26] Yasuhiro Suzuki,et al. Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length , 2008, IEICE Trans. Inf. Syst..
[27] 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.
[28] Alexander Barg,et al. Error exponents of expander codes , 2002, IEEE Trans. Inf. Theory.
[29] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[30] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[31] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..