ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the two-user binary adder channel with complete feedback, and let R(Of)R({\mathcal O}_f) denote its average zero-error capacity. Binary adder-channel conjecture. The average zero-error capacity is

R(Of)=0.78974.R({\mathcal O}_f)=0.78974.

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 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.