List Decoding in Average-Case Complexity and Pseudorandomness
- 25 May 2006
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Simple extractors for all min-entropies and a new pseudorandom generatorJournal of the ACM, 2005
- Pseudorandom Generators without the XOR LemmaJournal of Computer and System Sciences, 2001
- Extractors from Reed-Muller codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- List decoding algorithms for certain concatenated codesPublished by Association for Computing Machinery (ACM) ,2000
- List decodingACM SIGACT News, 2000
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Hardness vs randomnessJournal of Computer and System Sciences, 1994