Mathematics – Probability
Scientific paper
2007-12-31
Random Struct. Alg., 38, 502-525, 2011
Mathematics
Probability
30 pages, 4 figures. This version adds an appendix with short proofs of some of the cited results
Scientific paper
A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be 1. We address the following question: how high can the probability that all the bits are 1 be, for such a distribution? For a wide range of the parameters n,k and p we find an explicit lower bound for this probability which matches an upper bound given by Benjamini et al., up to multiplicative factors of lower order. The question we investigate can be seen as a relaxation of a major open problem in error-correcting codes theory, namely, how large can a linear error correcting code with given parameters be? The question is a type of discrete moment problem, and our approach is based on showing that bounds obtained from the theory of the classical moment problem provide good approximations for it. The main tool we use is a bound controlling the change in the expectation of a polynomial after small perturbation of its zeros.
Peled Ron
Yadin Ariel
Yehudayoff Amir
No associations
LandOfFree
The Maximal Probability that k-wise Independent Bits are All 1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Maximal Probability that k-wise Independent Bits are All 1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Maximal Probability that k-wise Independent Bits are All 1 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234846