Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
暂无分享,去创建一个
[1] Christian Thommesen. The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound , 1983, IEEE Trans. Inf. Theory.
[2] Venkatesan Guruswami,et al. Locally Testable Codes Require Redundant Testers , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[3] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[4] Or Meir,et al. High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.
[5] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[6] Venkatesan Guruswami,et al. Decoding concatenated codes using soft information , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[7] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[8] Venkatesan Guruswami,et al. The Existence of Concatenated Codes List-Decodable up to the Hamming Bound , 2010, IEEE Transactions on Information Theory.
[9] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[10] Venkatesan Guruswami,et al. Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates , 2004, SODA '04.
[11] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..
[12] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[13] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[14] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[15] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[16] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[17] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[18] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..
[19] E. Gilbert. A comparison of signalling alphabets , 1952 .