Deterministic extraction from weak random sources

✍ Scribed by Ariel Gabizon

• Publisher: Springer
• Year: 2011
• Tongue: English
• Leaves: 161
• Series: Monographs in Theoretical Computer Science. An EATCS Series
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xi
Introduction....Pages 1-10
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed....Pages 11-32
Deterministic Extractors for Affine Sources over Large Fields....Pages 33-53
Extractors and Rank Extractors for Polynomial Sources....Pages 55-89
Increasing the Output Length of Zero-Error Dispersers....Pages 91-122
Back Matter....Pages 123-148

✦ Subjects

Theory of Computation; Mathematics of Computing; Algebraic Geometry; Combinatorics