Deterministic Extraction from Weak Random Sources
-
- $84.99
-
- $84.99
Publisher Description
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.
GENRE
Computers & Internet
RELEASED
2010
October 7
LANGUAGE
EN
English
LENGTH
160
Pages
PUBLISHER
Springer Berlin Heidelberg
SELLER
Springer Nature B.V.
SIZE
4.6
MB
More Books Like This
Universal Coding and Order Identification by Model Selection Methods
2018
Computability and Complexity
2016
Computer Science – Theory and Applications
2016
Arithmetic of Finite Fields
2018
Locally Decodable Codes and Private Information Retrieval Schemes
2010
Computer Science – Theory and Applications
2017