Online Linear Extractors for Independent Sources

Abstract

In this work, we characterize online linear extractors. In other words, given a matrix AF2n×nA \in \mathbb{F}_2^{n \times n}, we study the convergence of the iterated process SASX\mathbf{S} \leftarrow A\mathbf{S} \oplus \mathbf{X} , where XD\mathbf{X} \sim D is repeatedly sampled independently from some fixed (but unknown) distribution DD with (min)-entropy at least kk. Here, we think of S{0,1}n\mathbf{S} \in \{0,1\}^n as the state of an online extractor, and X{0,1}n\mathbf{X} \in \{0,1\}^n as its input. As our main result, we show that the state S\mathbf{S} converges to the uniform distribution for all input distributions DD with entropy k>0k > 0 if and only if the matrix AA has no non-trivial invariant subspace (i.e., a non-zero subspace VF2nV \subsetneq \mathbb{F}_2^n such that AVVAV \subseteq V). In other words, a matrix AA yields an online linear extractor if and only if AA has no non-trivial invariant subspace. For example, the linear transformation corresponding to multiplication by a generator of the field F2n\mathbb{F}_{2^n} yields a good online linear extractor. Furthermore, for any such matrix convergence takes at most O~(n2(k+1)/k2)\widetilde{O}(n^2(k+1)/k^2) steps. We also study the more general notion of condensing---that is, we ask when this process converges to a distribution with entropy at least \ell, when the input distribution has entropy greater than kk. (Extractors corresponding to the special case when =n\ell = n.) We show that a matrix gives a good condenser if there are relatively few vectors wF2n\mathbf{w} \in \mathbb{F}_2^n such that w,ATw,,(AT)nk1w\mathbf{w}, A^T\mathbf{w}, \ldots, (A^T)^{n-k-1} \mathbf{w} are linearly dependent. As an application, we show that the very simple cyclic rotation transformation A(x1,,xn)=(xn,x1,,xn1)A(x_1,\ldots, x_n) = (x_n,x_1,\ldots, x_{n-1}) condenses to =n1\ell = n-1 bits for any k>1k > 1 if nn is a prime satisfying a certain simple number-theoretic condition. Our proofs are Fourier-analytic and rely on a novel lemma, which gives a tight bound on the product of certain Fourier coefficients of any entropic distribution

    Similar works