Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
暂无分享,去创建一个
[1] Shachar Lovett,et al. Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..
[2] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[3] Christian Knauer,et al. On counting point-hyperplane incidences , 2003, Comput. Geom..
[4] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[5] Venkatesan Guruswami. List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[6] YekhaninSergey,et al. High-rate codes with sublinear-time decoding , 2014 .
[7] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.
[8] János Pach,et al. Research problems in discrete geometry , 2005 .
[9] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[10] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[11] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[12] Salil P. Vadhan,et al. The unified theory of pseudorandomness , 2010 .
[13] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[14] 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).
[15] Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
[16] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[17] Peter Beelen,et al. Interpolation and List Decoding of Algebraic Codes , 2010 .
[18] Alexander Vardy,et al. Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.
[19] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2011, STOC '11.
[20] 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).
[21] Peter Beelen,et al. Decoding Folded Reed-Solomon Codes Using Hensel-Lifting , 2009, Gröbner Bases, Coding, and Cryptography.
[22] Venkatesan Guruswami,et al. Optimal Rate List Decoding via Derivative Codes , 2011, APPROX-RANDOM.
[23] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[24] Vojtech Rödl,et al. Pseudorandom sets and explicit constructions of ramsey graphs , 2004 .
[25] Ming-Deh A. Huang,et al. Folded Algebraic Geometric Codes From Galois Extensions , 2009, ArXiv.
[26] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[27] Venkatesan Guruswami,et al. List decoding subspace codes from insertions and deletions , 2012, ITCS '12.