Linear-Algebraic List Decoding of Folded Reed-Solomon Codes
暂无分享,去创建一个
[1] 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).
[2] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[3] Salil P. Vadhan,et al. The unified theory of pseudorandomness , 2010 .
[4] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[5] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[6] Vojtech Rödl,et al. Pseudorandom sets and explicit constructions of ramsey graphs , 2004 .
[7] János Pach,et al. Research problems in discrete geometry , 2005 .
[8] S. D. Chatterji. Proceedings of the International Congress of Mathematicians , 1995 .
[9] Venkatesan Guruswami,et al. Optimal Rate List Decoding via Derivative Codes , 2011, APPROX-RANDOM.
[10] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.
[11] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[12] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[13] Ran Raz,et al. Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[14] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[15] Christian Knauer,et al. On counting point-hyperplane incidences , 2003, Comput. Geom..
[16] Venkatesan Guruswami,et al. Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[17] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[18] Peter Beelen,et al. Interpolation and List Decoding of Algebraic Codes , 2010 .
[19] 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).
[20] Peter Beelen,et al. Decoding Folded Reed-Solomon Codes Using Hensel-Lifting , 2009, Gröbner Bases, Coding, and Cryptography.
[21] Ming-Deh A. Huang,et al. Folded Algebraic Geometric Codes From Galois Extensions , 2009, ArXiv.
[22] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[23] Venkatesan Guruswami. List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[24] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[25] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.