@inproceedings{69065f81e934489cb99c0fcedf1f55c0,
title = "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 ) ≤ (1 - 2α)2. In this paper, we derive a new upper bound that holds for all balanced functions, and improves upon the best known previous bound for α > 1 over 3.",
author = "Or Ordentlich and Ofer Shayevitz and Omri Weinstein",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",
year = "2016",
month = aug,
day = "10",
doi = "https://doi.org/10.1109/ISIT.2016.7541349",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "500--504",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "الولايات المتّحدة",
}