Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Memos (1974 - 2003)
  5. Extracting all the Randomness from a Weakly Random Source

Extracting all the Randomness from a Weakly Random Source

Thumbnail Image
Download
Name

MIT-LCS-TM-585.pdf

Size

2.02 MB

Format

Adobe PDF

Checksum (MD5)

55232bfcd4f8ec4968ef945ee68ad1cd

Author(s)
Vadhan, Salil
Date Issued
August 1998
Series/Report no.
MIT-LCS-TM-585
Abstract
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 first extracts any constant fraction of the min-entropy using O(log^2 n) additional random bits. The second extracts all the min-entropy using O(log 3 n) additional random bits. Both constructions use fewer truly random bits than any previous. construction which works for all min-entropies ans extracts a constant fraction of the min-entropy.
Persistent DSpace Link
https://hdl.handle.net/1721.1/149282
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.