Convexity conjecture for degraded CMLOBC capacity regions
Statement
Let , , and , and let the degraded CMLOBCs have channel matrices
with a stochastic incidence matrix of two-dimensional versus one-dimensional subspaces of . The channel is degraded under the conditions and .
Convexity conjecture. For the degraded CMLOBCs described above, the capacity region is strictly concave () if and only if
The preceding examples suggest that superposition coding gives no benefit over time sharing outside Case (i), but the source says that proving the conjecture in full generality is difficult. No resolution is given.
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.