The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding scheme. In contrast to other interactive capacity definitions in the literature, this definition makes no assumptions on the order of speakers (which can be adaptive) and does not allow any use of private / public randomness; hence, the essential interactive capacity is a function of the channel model only. It is shown that the essential interactive capacity of any binary memoryless symmetric (BMS) channel is at least $0.0302$ its Shannon capacity. To that end, we present a simple coding scheme, based on extended-Hamming codes combined with error detection, that achieves the lower bound in the special case of the binary symmetric channel (BSC). We then adapt the scheme to the entire family of BMS channels, and show that it achieves the same lower bound using extremes of the Bhattacharyya parameter.

翻译：与文献中的其他交互式能力定义相反,这一定义没有根据发言者的顺序作出假设(这可以是适应性的),也不允许使用私人/公共随机性;因此,基本的交互能力只是频道模型的一个函数。它表明,任何不留记忆的对称(BMS)频道的基本交互能力至少是其香农能力0.0302美元。为此,我们提出了一个简单的编码方案,以扩展-有害代码和误差探测为基础,在二进制对称频道(BSC)的特殊情况下达到较低的约束。然后,我们将该方案调整为BMS频道的整个家族,并显示它利用Bhattacharyya参数的极端达到同样的低约束。