ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let q=2q=2, m=3m=3, and l=2l=2, and let the degraded CMLOBCs have channel matrices

S(i)=(ϵ0(i)J7×1∣ϵ1(i)S21∣ϵ2(i)I7×7),\mathbf{S}^{(i)}=\bigl(\epsilon_{0}^{(i)}\mathbf{J}_{7\times1}\mid\epsilon_{1}^{(i)}\mathbf{S}_{21}\mid\epsilon_{2}^{(i)}\mathbf{I}_{7\times7}\bigr),

with S21\mathbf{S}_{21} a stochastic incidence matrix of two-dimensional versus one-dimensional subspaces of F23\mathbb{F}_{2}^{3}. The channel is degraded under the conditions ϵ0(1)≤ϵ0(2)\epsilon_{0}^{(1)}\leq\epsilon_{0}^{(2)} and ϵ0(1)+ϵ1(1)≤ϵ0(2)+ϵ1(2)\epsilon_{0}^{(1)}+\epsilon_{1}^{(1)}\leq\epsilon_{0}^{(2)}+\epsilon_{1}^{(2)}.

Convexity conjecture. For the degraded CMLOBCs described above, the capacity region is strictly concave (∩\cap) if and only if

ϵ1(1)ϵ2(2)>ϵ1(2)ϵ2(1).\epsilon_{1}^{(1)}\epsilon_{2}^{(2)}>\epsilon_{1}^{(2)}\epsilon_{2}^{(1)}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.