An Entropic Proof of Chang's Inequality
Computational Complexity
2012-05-17 v2 Combinatorics
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. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased.
Keywords
Cite
@article{arxiv.1205.0263,
title = {An Entropic Proof of Chang's Inequality},
author = {Russell Impagliazzo and Cristopher Moore and Alexander Russell},
journal= {arXiv preprint arXiv:1205.0263},
year = {2012}
}