2 problems

Consider fully adversarial binary error channels without shared randomness, with noise rate $\epsilon\to0$. Let $R$ denote the interactive channel capacity, namely the maximal asymp…

Let $Pi$ be an interactive protocol with a sufficiently non-regular, for example pseudo-random, communication order, and let $Pi'$ be a non-adaptive protocol whose communication or…