Folded codes from function field towers and improved optimal rate list decoding

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 339-350

  Guruswami, Venkatesan ^a   Xing, Chaoping ^b  

^a Carnegie Mellon University   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

algebraic codes; list decoding capacity; list error correction; pseudorandomness; subspace evasive sets

Indexed keywords

ALGEBRAIC CODES; LIST DECODING CAPACITIES; LIST ERROR CORRECTIONS; PSEUDORANDOMNESS; SUBSPACE-EVASIVE SETS;

ALGORITHMS; COMPUTATION THEORY; DECODING; OPTIMIZATION; REED-SOLOMON CODES;

ALGEBRA;

EID: 84862627897     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214009     Document Type: Conference Paper

References (16)

1. Z. Dvir and S. Lovett. Subspace-evasive sets. Electronic Colloquium on Computational Complexity, TR11-139, 2011.
2. P. Elias. Error-correcting codes for list decoding. IEEE Transactions on Information Theory, 37:5-12, 1991.
3. A. Garcia and H. Stichtenoth. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlǎ;dut bound. Inventiones Mathematicae, 121:211-222, 1995.
4. A. Garcia and H. Stichtenoth. On the asymptotic behavior of some towers of function fields over finite fields. Journal of Number Theory, 61(2):248-273, 1996. (Pubitemid 126172299)
5. V. Guruswami. Cyclotomic function fields, Artin-Frobenius automorphisms, and list error-correction with optimal rate. Algebra and Number Theory, 4(4):433-463, 2010.
6. V. Guruswami. Linear-algebraic list decoding of folded Reed-Solomon codes. In Proceedings of the 26th IEEE Conference on Computational Complexity, June 2011.
7. V. Guruswami and S. Narayanan. Combinatorial limitations of a strong form of list decoding. CoRR, abs/1202.6086, 2012.
8. V. Guruswami and A. Rudra. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. IEEE Transactions on Information Theory, 54(1):135-150, 2008.
9. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and Algebraic-geometric codes. IEEE Transactions on Information Theory, 45(6):1757-1767, 1999. (Pubitemid 32871911)
10. V. Guruswami and C. Wang. Optimal rate list decoding via derivative codes. In Proceedings of APPROX/RANDOM 2011, pages 593-604, August 2011.
11. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 285-294, 2005.
12. B. Z. Shen. A Justesen construction of binary concatanated codes that asymptotically meet the Zyablov bound for low rate. IEEE Transactions on Information Theory, 39:239-242, 1993.
13. K. Shum, I. Aleshnikov, P. V. Kumar, H. Stichtenoth, and V. Deolalikar. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Transactions on Information Theory, 47(6):2225-2241, 2001. (Pubitemid 32949882)
14. H. Stichtenoth. Algebraic Function Fields and Codes. Universitext, Springer-Verlag, Berlin, 1993.
15. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997. (Pubitemid 127172728)
16. S. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science (FnT-TCS). NOW publishers, 2010. To appear. Draft available at http://people.seas.harvard.edu/~salil/pseudorandomness/.