Optimal Rate List Decoding via Derivative Codes
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Limits to List Decoding Reed-Solomon Codes , 2006, IEEE Trans. Inf. Theory.
[2] 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).
[3] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[4] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[5] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[7] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[8] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[9] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[10] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[11] Venkatesan Guruswami. List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[12] Venkatesan Guruswami. Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate , 2010 .