# Average Bias and Polynomial Sources

Philips George John
Suprovat Ghoshal

Electronic Colloquium on Computational Complexity (ECCC), 2019.

Cited by: 0|Views32
EI

Abstract:

We identify a new notion of pseudorandomness for randomness sources, which we call the average bias. Given a distribution $Z$ over $\{0,1\}^n$, its average bias is: $b_{\text{av}}(Z) =2^{-n} \sum_{c \in \{0,1\}^n} |\mathbb{E}_{z \sim Z}(-1)^{\langle c, z\rangle}|$. A source with average bias at most $2^{-k}$ has min-entropy at least $k$...More

Code:

Data:

Get fulltext within 24h
Bibtex