Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...