Small-bias sample space
In theoretical computer science, a small-bias sample space (also known as -biased sample space, -biased generator, or small-bias probability space) is a probability distribution that fools parity functions. In other words, no parity function can distinguish between a small-bias sample space and the uniform distribution with high probability, and hence, small-bias sample spaces naturally give rise to pseudorandom generators for parity functions.
The main useful property of small-bias sample spaces is that they need far fewer truly random bits than the uniform distribution to fool parities. Efficient constructions of small-bias sample spaces have found many applications in computer science, some of which are derandomization, error-correcting codes, and probabilistically checkable proofs. The connection with error-correcting codes is in fact very strong since -biased sample spaces are equivalent to -balanced error-correcting codes.
where the sum is taken over , the finite field with two elements. In other words, the sum equals if the number of ones in the sample at the positions defined by is even, and otherwise, the sum equals . For , the empty sum is defined to be zero, and hence .
ϵ-biased sample space
An -biased sample space that is generated by picking a uniform element from a multiset is called -biased set. The size of an -biased set is the size of the multiset that generates the sample space.
An -biased generator is a function that maps strings of length to strings of length such that the multiset is an -biased set. The seed length of the generator is the number and is related to the size of the -biased set via the equation .
Connection with epsilon-balanced error-correcting codes
There is a close connection between -biased sets and -balanced linear error-correcting codes. A linear code of message length and block length is -balanced if the Hamming weight of every nonzero codeword is between and . Since is a linear code, its generator matrix is an -matrix over with .
Then it holds that a multiset is -biased if and only if the linear code , whose columns are exactly elements of , is -balanced.
Constructions of small epsilon-biased sets
Usually the goal is to find -biased sets that have a small size relative to the parameters and . This is because a smaller size means that the amount of randomness needed to pick a random element from the set is smaller, and so the set can be used to fool parities using few random bits.
The probabilistic method gives a non-explicit construction that achieves size . The construction is non-explicit in the sense that finding the -biased set requires a lot of true randomness, which does not help towards the goal of reducing the overall randomness. However, this non-explicit construction is useful because it shows that these efficient codes exist. On the other hand, the best known lower bound for the size of -biased sets is , that is, in order for a set to be -biased, it must be at least that big.
- Template:Harvtxt achieve . The construction makes use of Justesen codes (which is a concatenation of Reed–Solomon codes with the Wozencraft ensemble) as well as expander walk sampling.
- Template:Harvtxt achieve . One of their constructions is the concatenation of Reed–Solomon codes with the Hadamard code; this concatenation turns out to be an -balanced code, which gives rise to an -biased sample space via the connection mentioned above.
- Concatenating Algebraic geometric codes with the Hadamard code gives an -balanced code with .
- Template:Harvtxt achieves .
Application: almost k-wise independence
An important application of small-bias sets lies in the construction of almost k-wise independent sample spaces.
k-wise independent spaces
A random variable over is a k-wise independent space if, for all index sets of size , the marginal distribution is exactly equal to the uniform distribution over . That is, for all such and all strings , the distribution satisfies .
Constructions and bounds
k-wise independent spaces are fairly well-understood.
- A simple construction by Template:Harvtxt achieves size .
- Template:Harvtxt construct a k-wise independent space whose size is .
- Template:Harvtxt prove that no k-wise independent space can be significantly smaller than .
Template:Harvtxt constructs a -wise independent space over the finite field with some prime number of elements, i.e., is a distribution over . The initial marginals of the distribution are drawn independently and uniformly at random:
where the calculation is done in . Template:Harvtxt proves that the distribution constructed in this way is -wise independent as a distribution over . The distribution is uniform on its support, and hence, the support of forms a -wise independent set. It contains all strings in that have been extended to strings of length using the deterministic rule above.
Almost k-wise independent spaces
A random variable over is a -almost k-wise independent space if, for all index sets of size , the restricted distribution and the uniform distribution on are -close in 1-norm, i.e., .
Template:Harvtxt give a general framework for combining small k-wise independent spaces with small -biased spaces to obtain -almost k-wise independent spaces of even smaller size. In particular, let be a linear mapping that generates a k-wise independent space and let be a generator of an -biased set over . That is, when given a uniformly random input, the output of is a k-wise independent space, and the output of is -biased. Then with is a generator of an -almost -wise independent space, where .