Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
暂无分享,去创建一个
[1] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[2] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[3] Venkatesan Guruswami,et al. Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs , 2016, IEEE Transactions on Information Theory.
[4] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[5] V. Wei,et al. Error-Correcting Codes for List Decoding , 1994 .
[6] Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
[7] Venkatesan Guruswami,et al. Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets , 2006, FOCS.
[8] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[9] Shachar Lovett,et al. Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..
[10] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[11] Venkatesan Guruswami,et al. Combinatorial Limitations of Average-Radius List-Decoding , 2012, IEEE Transactions on Information Theory.
[12] 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).
[13] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[14] Ba-Zhong Shen. A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate , 1993, IEEE Trans. Inf. Theory.
[15] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[16] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[17] H. Niederreiter,et al. Rational Points on Curves Over Finite Fields: Theory and Applications , 2001 .
[18] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[19] 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.
[20] Venkatesan Guruswami,et al. Dimension Expanders via Rank Condensers , 2014, Electron. Colloquium Comput. Complex..
[21] V. Guruswami. Algebra & Number Theory , 2010 .