Optimal $\varepsilon$-Biased Sets with Just a Little Randomness

DOI10.1137/130934490zbMath1393.68127arXiv1205.6218OpenAlexW2963572208MaRDI QIDQ5499738

Alexander Russell, Moore, Cristopher

Publication date: 31 July 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

derandomizationcoding theorypseudorandomnessGilbert-Varshamov bound

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Pseudorandom generators for space-bounded computation
• Approximating probability distributions using small sample spaces
• On recycling the randomness of states in space bounded computation
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Pseudorandom Generators for Regular Branching Programs
• Simple Constructions of Almost k-wise Independent Random Variables
• Constructing Small-Bias Sets from Algebraic-Geometric Codes

This page was built for publication: Optimal $\varepsilon$-Biased Sets with Just a Little Randomness