Capacity region of the linear deterministic broadcast channel with a diamond message set
Statement
Let be the number of receivers, let be the diamond message set, and let denote the rank associated with a receiver-index set :
The message rates are .
The capacity-region claim. The capacity region of the -user linear deterministic broadcast channel for this diamond message set is the set of non-negative rate tuples satisfying, for every ,
The claim gives an exact characterization of the achievable rates for this deterministic broadcast-channel message configuration; the supplied text does not indicate whether the result is intended as a conjecture or has an independently established resolution.
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.