Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DISCRETE MEMORYLESS CHANNELS:
Reports tagged with discrete memoryless channels:
TR16-033 | 10th March 2016
Suppose Alice holds a uniformly random string $X \in \{0,1\}^N$ and Bob holds a noisy version $Y$ of $X$ where each bit of $X$ is flipped independently with probability $\epsilon \in [0,1/2]$. Alice and Bob would like to extract a common random string of min-entropy at least $k$. In this ... more >>>