List Error-Correction with Optimal Information Rate (Invited Talk)
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[2] Aggelos Kiayias,et al. Decoding of Interleaved Reed Solomon Codes over Noisy Data , 2003, ICALP.
[3] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[4] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[5] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[6] Madhu Sudan,et al. Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.
[7] A. Kiayias,et al. Directions in Polynomial Reconstruction Based Cryptography , 2004 .
[8] 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).
[9] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[10] Venkatesan Guruswami,et al. List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.
[11] 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).