An improved upper bound for the most informative boolean function conjecture

Abstract

Suppose X is a uniformly distributed n-dimensional binary vector and Y is obtained by passing X through a binary symmetric channel with crossover probability α. A recent conjecture by Courtade and Kumar postulates that I(f(X); Y ) ≤ 1 - h(α) for any Boolean function f. So far, the best known upper bound was essentially I(f(X); Y… (More)
DOI: 10.1109/ISIT.2016.7541349

Topics

1 Figure or Table

Statistics

05020162017
Citations per Year

Citation Velocity: 23

Averaging 23 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics