An Entropic Proof of Chang's Inequality
  Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased. 
Russell Impagliazzo, Cristopher Moore, and Alexander Russell
cs.CC math.CO