Deterministic extraction from weak random sources

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Ariel Gabizon
Series: Monographs in Theoretical Computer Science. An EATCS Series
Publisher: Springer
Year: 2011

Language: English
Commentary: +cover, but no hyperrefs
Pages: 161
Tags: Theory of Computation; Mathematics of Computing; Algebraic Geometry; Combinatorics

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