Extracting All the Randomness from a Weakly Random Source

@article{Vadhan1998ExtractingAT,
  title={Extracting All the Randomness from a Weakly Random Source},
  author={Salil P. Vadhan},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={1998},
  volume={5}
}
  • Salil P. Vadhan
  • Published 1998 in Electronic Colloquium on Computational Complexity
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction of the min-entropy using O(log n) additional random bits. The second extracts all the min-entropy using O(log n) additional random bits. Both constructions use fewer truly random bits than any previous construction which works for all min-entropies and extracts a constant fraction of the min-entropy. The extractors are… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Almost optimal dispersers

  • V. Umesh
  • Proceedings of the 30 th Annual ACM Symposiumon…
  • 1998

Simple and improved construction of extractors

  • Amnon Ta-Shma.
  • Unpublished manuscript , July
  • 1998

Similar Papers

Loading similar papers…