Extractor codes

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 193-199

  Ta Shma, A ^a   Zuckerman, D ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; ERROR CORRECTION; THEOREM PROVING;

EXTRACTOR CODES;

CODES (SYMBOLS);

EID: 0034826178     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380800     Document Type: Conference Paper

References (20)

1. Finding smooth integers in short intervals using CRT decoding
2. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
3. List decoding for noisy channels
4. A hard-core predicate for all one-way functions
5. Combinatorial bounds for list decoding
6. Improved decoding of Reed-Solomon and algebraic-geometric codes
7. Probability inequalities for sums of bounded random variables
8. Randomness is linear in space
9. Bounds for dispersers, extractors, and depth-two superconcentrators
10. Extracting all the randomness and reducing the error in Trevisan's extractors
11. Expander codes
12. Decoding of Reed Solomon codes beyond the error-correction bound
13. List decoding: Algorithms and applications
14. Pseudorandom generators without the XOR lemma
15. Construction of extractors using pseudo-random generators
16. Expanders that beat the eigenvalue bound: Explicit construction and applications
17. List decoding
18. Randomness-optimal oblivious sampling