The binary-alphabet concave-envelope conjecture for Marton's inner bound
Statement
Let be a Markov chain for a broadcast channel with binary input alphabet . Define
and let denote the upper concave envelope of at . Put .
Binary-alphabet concave-envelope conjecture. For all and all such Markov chains,
The underlying pointwise inequality is known to fail for some binary-input broadcast channels, but the conjectured concave-envelope inequality may still hold for the distributions needed to compute the envelope. The source proves the underlying inequality for several cases and for the binary skew-symmetric broadcast channel, but gives no resolution of this conjecture.
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.