Sum-rate conjecture for the binary skew-symmetric broadcast channel
Statement
Let be auxiliary random variables and let be the input and outputs of the binary skew-symmetric channel with , such that is a Markov chain. Sum-rate conjecture. The following inequality holds:
If true, this conjecture would bound the sum rate of the Márton inner bound by approximately , while the evaluated outer bound has maximum sum rate approximately . Thus it would establish that the inner and outer bounds are not tight for the binary skew-symmetric channel.
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.