Conjecture that a flattened-noise channel is at least as informative for every Boolean function
Statement
Let be uniformly distributed on , let be the output of a memoryless binary symmetric channel with crossover probability , and let be a modified additive-noise output whose principal inertia components with all satisfy . Let and set .
Flattened-noise informativeness conjecture. For every such ,
The source motivates this comparison because the modified channel acts as an all-pass filter and would imply the Kumar–Courtade bound if the inequality held. The supplied text gives no resolution or status evidence.
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.