Gabizon, Ariel. <br/><br/>
Deterministic Extraction from Weak Random Sources  [electronic resource] / 
by Ariel Gabizon. 
 - XII, 148 p.  online resource. 
 - Monographs in Theoretical Computer Science. An EATCS Series,  1431-2654 .
 - Monographs in Theoretical Computer Science. An EATCS Series, .
<br/><br/>ZDB-2-SCS 
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9783642149030 
<br/><br/><label>Standard No.: </label>10.1007/978-3-642-14903-0  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Information theory.<br/>Geometry, algebraic.<br/>Combinatorics.<br/>Computer Science.<br/>Theory of Computation.<br/>Mathematics of Computing.<br/>Algebraic Geometry.<br/>Combinatorics.
<br/><br/><label>LC Class. No.: </label>QA75.5-76.95 
<br/><br/><label>Dewey Class. No.: </label>004.0151