Achieving list decoding capacity using folded Reed-Solomon codes
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes or decoding up to the singleton bound using folded Reed-Solomon codes , 2006 .
[2] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[3] Aggelos Kiayias,et al. Decoding of Interleaved Reed Solomon Codes over Noisy Data , 2003, ICALP.
[4] Madhu Sudan,et al. Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.
[5] V. Wei,et al. Error-Correcting Codes for List Decoding , 1994 .
[6] Harald Niederreiter,et al. Introduction to finite fields and their applications: Preface , 1994 .
[7] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[8] Alexander Vardy,et al. Multivariate interpolation decoding beyond the Guruswami-Sudan radius , 2004 .
[9] Victor Yu. Krachkovsky. Reed-Solomon codes for correcting phased error bursts , 2003, IEEE Trans. Inf. Theory.
[10] 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).
[11] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[12] 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).
[13] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[14] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[15] E. Berlekamp. Factoring polynomials over large finite fields , 1970 .