ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
List decoding: algorithms and applications
Full text PdfPdf (844 KB)
Source ACM SIGACT News archive
Volume 31 ,  Issue 1  (March 2000) table of contents
Pages: 16 - 27  
Year of Publication: 2000
ISSN:0163-5700
Author
Madhu Sudan  Dept. of Computer Science, University of Rochester, Rochester, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Citation Count: 11
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/346048.346049
What is a DOI?

CITED BY  11
Amnon Ta-Shma , David Zucherman, Extractor codes, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.193-199, July 2001, Hersonissos, Greece
M. Kiwi, Algebraic testing and weight distributions of codes, Theoretical Computer Science, v.299 n.1-3, p.81-106, 18 April 2003
Venkatesan Guruswami, Better extractors for better codes?, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
Venkatesan Guruswami, Guest column: error-correcting codes and expander graphs, ACM SIGACT News, v.35 n.3, September 2004
Venkatesan Guruswami , Atri Rudra, Explicit capacity-achieving list-decodable codes, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
Venkatesan Guruswami, Algorithmic results in list decoding, Foundations and Trends® in Theoretical Computer Science, v.2 n.2, p.107-195, January 2007
Tomoyuki Yamakami, Quantum list decoding from quantumly corrupted codewords for classical block codes of polynomially small rate, Proceedings of the thirteenth Australasian symposium on Theory of computing, p.153-162, January 30-February 02, 2007, Ballarat, Victoria, Australia
Parikshit Gopalan , Adam R. Klivans , David Zuckerman, List-decoding reed-muller codes over small fields, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
S. Vadhan, The unified theory of pseudorandomness: guest column, ACM SIGACT News, v.38 n.3, September 2007
Marius Zimand, Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time, Computational Complexity, v.17 n.2, p.220-253, May 2008
Parikshit Gopalan , Venkatesan Guruswami , Prasad Raghavendra, List decoding tensor products and interleaved codes, Proceedings of the 41st annual ACM symposium on Theory of computing, May 31-June 02, 2009, Bethesda, MD, USA

INDEX TERMS

Primary Classification:
  E. Data
  E.4 CODING AND INFORMATION THEORY
      Subjects: Error control codes

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Madhu Sudan: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player