2017/09/26 by Assaf Ben-Yishai, Ben-Yishai, Assaf, Ofer Shayevitz +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1709.09123
openalex publication_date 2017/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We address the problem of simulating an arbitrary Markovian interactive protocol over binary symmetric channels with crossover probability ε. We are interested in the achievable rates of reliable simulation, i.e., in characterizing the smallest possible blowup in communications such that a vanishing error probability (in the protocol length) can be attained. Whereas for general interactive protocols the output of each party may depend on all previous outputs of its counterpart, in a (first order) Markovian protocol this dependence is limited to the last observed output only. In the special case where there is no dependence on previous outputs (no interaction), the maximal achievable rate is given by the (one-way) Shannon capacity 1-h(ε). For Markovian protocols, we first show that a rate of (2)/(3)(1-h(ε)) can be trivially achieved. We then describe a more involved coding scheme and provide a closed-form lower bound for its rate at any noise level ε. Specifically, we show that this scheme outperforms the trivial one for any ε<0.044, and achieves a rate higher than (1-h(ε))/(1+h(ε)+h())=1-Θ(h(ε)) as ε→ 0, which is order-wise the best possible. This should be juxtaposed with a result of Kol and Raz that shows the capacity for interactive protocols with alternating rounds is lower bounded by 1-O(√(h(ε))).