Decoding Reed-Solomon Codes
暂无分享，去创建一个
[1] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[2] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[3] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[4] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[5] Venkatesan Guruswami,et al. Limits to List Decoding Reed-Solomon Codes , 2006, IEEE Trans. Inf. Theory.
[6] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[7] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[8] Venkatesan Guruswami,et al. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard , 2004, SODA.
[9] 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).
[10] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[11] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.