Adversarial binary interactive capacity conjecture without shared randomness
Statement
Consider fully adversarial binary error channels without shared randomness, with noise rate . Let denote the interactive channel capacity, namely the maximal asymptotically achievable communication rate. Adversarial binary interactive capacity conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.