Limits to List Decoding Reed–Solomon Codes
暂无分享,去创建一个
[1] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[2] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[3] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[4] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[5] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[6] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[7] Venkatesan Guruswami,et al. Limits to List Decoding Reed-Solomon Codes , 2006, IEEE Trans. Inf. Theory.
[8] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[9] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] 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).
[11] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[12] Chaoping Xing,et al. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound , 2003, IEEE Transactions on Information Theory.
[13] Qi Cheng,et al. On the list and bounded distance decodibility of Reed-Solomon codes , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[14] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[15] Tom Høholdt,et al. Bounds on list decoding of MDS codes , 2001, IEEE Trans. Inf. Theory.
[16] 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).
[17] Venkatesan Guruswami,et al. Extensions to the Johnson bound , 2001 .
[18] Qi Cheng,et al. On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract) , 2004, FOCS.
[19] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.