Unbiased bits from sources of weak randomness and probabilistic communication complexity

  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)},
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

From This Paper

Topics from this paper.
11 Citations
11 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 11 references

Unbiased Bits frorn Sourees of Weak J~andorTlncss and Probabilistic Comrnuuication COlnplcxity

  • jhor, Il, O. Goldreich
  • MJ 'fiLeS /1'M-283,
  • 1985

Information 1'ransfer under Different Sets of Protocols

  • J. Ja'Ja, V. K. Prasanna Kumar, J. Simon
  • SIAM Jour. on Computing,
  • 1981

Colnplexity of l~robabilistic Turing Machines

  • J. Gill
  • SIAM Jour. on Computing,
  • 1977

The Theory of Error

  • F. J. McWilliams, N.J.A. Sloane
  • Correcting Codes, Northllolland Publishing…
  • 1977

Graph Theory with Applications, Arnerican Elsevier j-)u blishing (jo

  • Jlondy, LA, U.S.ll. Murty
  • 1976

'fhe l~fncient Construction of an Unbiased IlandoIJl Sequence

  • llias
  • Ann. Math. Statist., Vol. 13,
  • 1972

Probability Theory, North~I-Iolland }">ublishing

  • A. lcnyi
  • Cornpany
  • 1970

Similar Papers

Loading similar papers…