Affiliation:
1. Massachusetts Institute of Technology, Cambridge, MA
2. KTH-Royal Institute of Technology
3. Northeastern University, Huntington Avenue, West Village H, Boston, MA
Abstract
For a test
T
⊆ {0, 1}
n
, define
k
*
(
T
) to be the maximum
k
such that there exists a
k
-wise uniform distribution over {0, 1}
n
whose support is a subset of
T
.
For
H
t
= {
x
∈ {0, 1}
n
: | ∑
i
x
i
−
n
/2| ≤
t
}, we prove
k
*
(
H
t
) = Θ (
t
2
/
n
+ 1).
For
S
m, c
= {
x
∈ {0, 1}
n
: ∑
i
x
i
≡
c
(mod
m
)}, we prove that
k
*
(
S
m, c
) = Θ (
n
/
m
2
). For some
k
=
O
(
n
/
m
) we also show that any
k
-wise uniform distribution puts probability mass at most 1/
m
+ 1/100 over
S
m, c
. Finally, for any fixed odd
m
we show that there is an integer
k
= (1 − Ω(1))
n
such that any
k
-wise uniform distribution lands in
T
with probability exponentially close to |
S
m, c
|/2
n
; and this result is false for any even
m
.
Funder
National Science Foundation
Vetenskapsrådet
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献