Any interactive protocol between a pair of parties can be reliably simulated in the presence of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The reciprocal of the best (least) overhead is called the interactive capacity of the noisy channel. In this work, we present lower bounds on the interactive capacity of the binary erasure channel. Our lower bound improves the best known bound due to Ben-Yishai et al. 2021 by roughly a factor of 1.75. The improvement is due to a tighter analysis of the correctness of the simulation protocol using error pattern analysis. More precisely, instead of using the well-known technique of bounding the least number of erasures needed to make the simulation fail, we identify and bound the probability of specific erasure patterns causing simulation failure. We remark that error pattern analysis can be useful in solving other problems involving stochastic noise, such as bounding the interactive capacity of different channels.

翻译：任意双方之间的交互协议可以在噪声环境下通过轮次数乘性开销可靠模拟（Schulman 1996）。最佳（最小）开销的倒数称为噪声信道的交互容量。本文给出了二元擦除信道交互容量的下界。我们的下界相比Ben-Yishai等人2021年提出的最佳已知界提升了约1.75倍。该提升源于利用错误模式分析对模拟协议正确性进行了更紧致的分析。具体而言，我们不再采用传统的通过界定导致模拟失败所需最少擦除次数的方法，而是识别并界定了特定擦除模式导致模拟失败的概率。我们指出，错误模式分析可有效解决涉及随机噪声的其他问题，例如不同信道交互容量的界估计。