ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider fully adversarial binary error channels without shared randomness, with noise rate epsilon→0epsilon\to0. Let RR denote the interactive channel capacity, namely the maximal asymptotically achievable communication rate. Adversarial binary interactive capacity conjecture.

R=1−Θ(ϵlog⁡log⁡1ϵ).R=1-\Theta\left(\sqrt{\epsilon\log\log\frac{1}{\epsilon}}\right).

This conjecture concerns the fully adversarial binary setting without shared randomness; the source notes that the corresponding bound does not extend to larger alphabets.

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.