Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

CORR
2010
Springer

favoriteEmaildiscussreport

150views Education» more CORR 2010»

On extracting common random bits from correlated sources

13 years 8 months ago

On extracting common random bits from correlated sources

Download www.cse.cuhk.edu.hk

Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of random bits with high probability but without communicating. How many such bits can they extract? The trivial strategy of outputting the first k bits yields an

Andrej Bogdanov, Elchanan Mossel

Real-time Traffic

CORR 2010 | Education | Noisy Bits | Random Bits | Respective Strings |

claim paper

Related Content

» Extracting All the Randomness from a Weakly Random Source

» How to Get More Mileage from Randomness Extractors

» Extracting Correlations

» Extractors and Lower Bounds for Locally Samplable Sources

» The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels

» Extracting Randomness Using Few Independent Sources

» An embedded true random number generator for FPGAs

» The Multiple Access Channel with Feedback and Correlated Sources

» Extracting Randomness via Repeated Condensing

Post Info
More Details (n/a)

Added	22 Mar 2011
Updated	22 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Andrej Bogdanov, Elchanan Mossel

Comments (0)