Highly Influenced

# Unbiased bits from sources of weak randomness and probabilistic communication complexity

@article{Chor1985UnbiasedBF, title={Unbiased bits from sources of weak randomness and probabilistic communication complexity}, author={Benny Chor and Oded Goldreich}, journal={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, year={1985}, pages={429-442} }

- Published 1985 in 26th Annual Symposium on Foundations of Computer…
DOI:10.1109/SFCS.1985.62

We introduce a general model for physical sources or weak randomness. Loosely speaking, we view physical sources as devices which output strings according to probability distributions in which no single string is too probable. The main question addressed is whether it is possible to extract alrnost unbiased random bits from such "probability bounded" sources. We show that most or the functions can be used to extract almost unbiased and independent bits from the output of any two independent… CONTINUE READING