The most-informative Boolean function conjecture
Statement
Let be uniformly distributed on the Boolean hypercube, and let be obtained by passing each bit of through a binary symmetric channel with crossover probability . Let be a Boolean function, and let be binary entropy. The most-informative Boolean function conjecture. One has
This conjecture asks which Boolean functions maximize the mutual information through a binary symmetric channel. It is known for balanced Boolean functions in a neighborhood of zero correlation, including , but remains open in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.