Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Which Boolean Functions Maximize Mutual Information on Noisy Inputs?
Thomas A. Courtade (University of California, Berkeley), Gowtham Ramani Kumar (Stanford University)
Résumé : We pose a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let Xnbe independent identically distributed Bernoulli(1/2), and let Yn be the result of passing Xnthrough a memoryless binary symmetric channel with crossover probability α. For any Boolean function b : {0, 1}n→ {0, 1}, we conjecture that I(b(Xn); Yn) ≤ 1 - H(α). While the conjecture remains open, we provide substantial evidence supporting its validity. Connections are also made to discrete isoperimetric inequalities.