The weighted-capacity optimization conjecture for the binary adder channel
Statement
Let denote the one-dimensional probability simplex, and let be the Dueck zero-error capacity region of the binary adder channel with complete feedback. For , define
For , write and , and let and denote the corresponding binary entropy expressions. The functions and are those defining the optimization problem in the source.
Weighted-capacity optimization conjecture. For every , equals the optimum of
The claim would reduce the optimization over the auxiliary variable to the case . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.