Deterministic Extraction from Weak Random Sources

  • Ariel¬†Gabizon

Table of contents

  1. Front Matter
    Pages i-xi
  2. Ariel Gabizon
    Pages 1-10
  3. Back Matter
    Pages 123-148

About this book

Introduction

A deterministic extractor is a function that extracts almost perfect random bits from a weak random source. In this research monograph the author constructs deterministic extractors for several types of sources. A basic theme in this work is a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length. The author's main work examines deterministic extractors for bit-fixing sources, deterministic extractors for affine sources and polynomial sources over large fields, and increasing the output length of zero-error dispersers. This work will be of interest to researchers and graduate students in combinatorics and theoretical computer science.

Keywords

Affine sources Derandomization Deterministic extractors Dispersers Randomness extractors Recycling randomness

Authors and affiliations

  • Ariel¬†Gabizon
    • 1
  1. 1.Dept. Computer ScienceUniversity of Texas at AustinAustin, TXUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14903-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14902-3
  • Online ISBN 978-3-642-14903-0
  • Series Print ISSN 1431-2654
  • About this book