Conjecture on the binary two-user adder channel with complete feedback
Statement
Consider the two-user binary adder channel with complete feedback, and let denote its average zero-error capacity. Binary adder-channel conjecture. The average zero-error capacity is
The paper states that the zero-error capacity remains undetermined and believes this value is the tight binary lower bound established by Belokopytov. The conjecture is therefore presented as an open problem in the supplied text.
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.