On the most informative Boolean function under noise
cs.IT, math.CO, math.IT
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/deepinfra/courtade-kumar
Terminology
Sources
- The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-M'edard Conjecture are Equivalent
- Progress on the Courtade-Kumar Conjecture: Optimal High-Noise Entropy Bounds and Generalized Coordinate-wise Mutual Information
- Remarks on the Most Informative Function Conjecture at fixed mean
- Which Boolean Functions are Most Informative?
- Boolean functions: noise stability, non-interactive correlation distillation, and mutual information
- An Improved Upper Bound for the Most Informative Boolean Function Conjecture
- The "Most informative boolean function" conjecture holds for high noise
- On the Courtade-Kumar conjecture for certain classes of Boolean functions
- The maximum mutual information between the output of a discrete symmetric channel and several classes of Boolean functions of its input
- On the Most Informative Boolean Functions of the Very Noisy Channel
- Local Optimality of Dictator Functions with Applications to Courtade--Kumar and Li--M'edard Conjectures
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound