## Constructions of Near-Optimal Extractors Using Pseudo-Random Generators (1998)

Venue: | Electronic Colloquium on Computational Complexity |

Citations: | 20 - 3 self |

### BibTeX

@INPROCEEDINGS{Trevisan98constructionsof,

author = {Luca Trevisan},

title = {Constructions of Near-Optimal Extractors Using Pseudo-Random Generators},

booktitle = {Electronic Colloquium on Computational Complexity},

year = {1998},

pages = {141--148},

publisher = {ACM Press}

}

### OpenURL

### Abstract

We introduce a new approach to construct extractors --- combinatorial objects akin to expander graphs that have several applications. Our approach is based on error correcting codes and on the Nisan-Wigderson pseudorandom generator. A straightforward application of our approach yields a construction that is simple to describe and analyze, does not use any of the standard techniques used in related results, and improves or subsumes almost all the previous constructions. 1 Introduction Informally defined, an extractor is a function that extracts randomness from a weakly random distribution. Explicit constructions of extractors have several applications and are typically very hard to achieve. In this paper we introduce a new approach to the explicit construction of extractors. Our approach yields a construction that improves most of the known results, and that is optimal for certain parameters. Furthermore, our construction is simple and uses techniques that were never used in this field...