ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Δ1\Delta^1 denote the one-dimensional probability simplex, and let Of\mathcal{O}_f be the Dueck zero-error capacity region of the binary adder channel with complete feedback. For (c1,c2)∈Δ1(c_1,c_2)\in\Delta^1, define

R(Of;c1,c2):=sup⁡{c1R1+c2R2:(R1,R2)∈Of}.R(\mathcal{O}_f;c_1,c_2):=\sup\{c_1R_1+c_2R_2:(R_1,R_2)\in\mathcal{O}_f\}.

For a,b∈[0,1]a,b\in[0,1], write aˉ=1−a\bar a=1-a and bˉ=1−b\bar b=1-b, and let H2(a,aˉ)H_2(a,\bar a) and H2(b,bˉ)H_2(b,\bar b) denote the corresponding binary entropy expressions. The functions S3S_3 and S4S_4 are those defining the optimization problem in the source.

Weighted-capacity optimization conjecture. For every (c1,c2)∈Δ1(c_1,c_2)\in\Delta^1, R(Of;c1,c2)R(\mathcal{O}_f;c_1,c_2) equals the optimum of

Maximize: c1H2(a,aˉ)+c2H2(b,bˉ),subject to: S3(abˉ+aˉb+2c)≥S4(a,b,c)for every c∈[−min⁡(abˉ,aˉb),min⁡(ab,aˉbˉ)],a∈[0,1],b∈[0,1].\begin{aligned} \text{Maximize: }&c_1H_2(a,\bar a)+c_2H_2(b,\bar b),\\ \text{subject to: }&S_3(a\bar b+\bar a b+2c)\ge S_4(a,b,c)\\ &\text{for every }c\in[-\min(a\bar b,\bar a b),\min(ab,\bar a\bar b)],\\ &a\in[0,1],\quad b\in[0,1]. \end{aligned}

The claim would reduce the optimization over the auxiliary variable n∈Nn\in\mathbb{N} to the case n=1n=1. The paper presents it as an open problem motivated by numerical experiments, and does not establish the asserted equality.

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.