Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets
暂无分享,去创建一个
[1] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .
[2] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .
[3] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[4] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[5] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .
[6] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[7] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[8] Venkatesan Guruswami,et al. "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[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. On representations of algebraic-geometry codes , 2001, IEEE Trans. Inf. Theory.
[11] Kenneth W. Shum,et al. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.
[12] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[13] 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).
[14] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.