Nair–Wang information inequality for the binary skew-symmetric broadcast channel
Statement
We consider the binary skew-symmetric broadcast channel with input and outputs . Let be random variables such that
forms a Markov chain. Nair–Wang information inequality. For all such ,
The inequality is relevant to determining the capacity region of the binary skew-symmetric broadcast channel: if it holds, a sum-rate line segment on Marton's inner bound lies on its boundary. The source does not provide evidence that the conjecture has been resolved.
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.