Skip to main content
An Entropic Proof of Chang's Inequality
Abstract
Chang s lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. We obtain a tight constant and give a slight improvement in the case where the variables are highly biased. © 2014 Society for Industrial and Applied Mathematics.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.