The maximal probability that k‐wise independent bits are all 1

DOI10.1002/rsa.20329zbMath1225.60025arXiv0801.0059OpenAlexW2964115870MaRDI QIDQ5198667

Ariel Yadin, Amir Yehudayoff, Ron Peled

Publication date: 9 August 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.0059

zbMATH Keywords

error correcting codesdiscrete moment probleminclusion-exclusionclassical moment problem\(k\)-wise independence

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Linear codes (general theory) (94B05)

Related Items (4)

The Hsu-Robbins-Erdös theorem for the maximum partial sums of quadruplewise independent random variables ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Small deviations of sums of independent random variables ⋮ Approximate maximizers of intricacy functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate inclusion-exclusion
• On covering radius and discrete Chebyshev polynomials
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
• Boole-Bonferroni Inequalities and Linear Programming
• A new method for generating Bonferroni-type inequalities by iteration
• Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
• Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
• An Inequality for Probabilities

This page was built for publication: The maximal probability that k‐wise independent bits are all 1