Soft decoding, dual BCH codes, and better list-decodable ε-biased codes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 163-174

  Guruswami, Venkatesan ^a   Rudra, Atri ^b  

^a University of Washington   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES; BINARY LINEAR CODES; SOFT DECODING;

DECODING; MATHEMATICAL TECHNIQUES; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 51749105922     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.13     Document Type: Conference Paper

References (28)

1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38:509-516, 1992.
2. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3:289-304, 1992.
3. J.-Y. Cai, A. Pavan, and D. Sivakumar. On the hardness of the permanent. Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, pages 90-99, March 1999.
4. P. Elias. Error-correcting codes for list decoding. IEEE Transactions on Information Theory, 37:5-12, 1991.
5. U. Feige, M. Langberg, and K. Nissim. On the hardness of approximating NP witnesses. Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pages 120-131, September 2000.
6. A. Gál, S. Halevi, R. J. Lipton, and E. Petrank. Computing from partial solutions. Proceedings of the 14th Annual IEEE Conference on Computation Complexity, pages 34-45, 1999.
7. O. Goldreich and L. Levin. A hard-core predicate for all oneway functions. Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 25-32, May 1989.
8. V. Guruswami. List decoding of error-correcting codes. Number 3282 in Lecture Notes in Computer Science. Springer, 2004.
9. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5):1021-1035, 2002.
10. 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, January 2008.
11. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999.
12. V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 181-190, 2000.
13. V. Guruswami and M. Sudan. Decoding concatenated codes using soft information. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC), pages 148-157, 2002.
14. T. Kaufman and S. Litsyn. Almost orthogonal linear codes are locally testable. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 317-326, 2005.
15. M. Kiwi. Testing and weight distributions of dual codes. ECCC Technical Report TR-97-010, 1997.
16. R. Koetter. On optimal weight assignments for multivariate interpolation list-decoding. In Proc. 2006 IEEE Information Theory Workshop, pages 37-41, March 2006.
17. R. Kumar and D. Sivakumar. Proofs, codes, and polynomial-time reducibilities. Proceedings of the 14th Annual IEEE Conference on Computation Complexity, pages 46-53, 1999.
18. M. Ledoux and M. Talagrand. Probability in Banach Spaces. Springer, 1991.
19. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. Elsevier/North-Holland, Amsterdam, 1981.
20. E. Mossel and C. Umans. On the complexity of approximating the VC dimension. J. Comput. Syst. Sci., 65(4):660-671, 2002.
21. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, 1993.
22. 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.
23. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. Journal of the ACM, 52(2):172-216, 2005.
24. D. Sheldon and N. E. Young. Hamming approximation of NP witnesses, November 2003. Manuscript.
25. D. Sivakumar. On membership comparable sets. J. Comput. Syst. Sci., 59(2):270-280, October 1999.
26. M. Sudan. List decoding: Algorithms and applications. SIGACT News, 31:16-27, 2000.
27. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. J. Comput. Sys. Sci., 62(2):236-266, 2001.
28. V. V. Zyablov and M. S. Pinsker. List cascade decoding. Problems of Information Transmission, 17(4):29-34, 1981 (in Russian); pp. 236-240 (in English), 1982.