@inproceedings{6a5dfdfbf8ee468a8fbb6d559121cf99,
title = "Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols",
abstract = "We address the problem of simulating a binary interactive protocol over a pair of 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. We analyze the family of Mth-order Markovian protocols in which the transmission at every time depends only on the last M bits of the protocol. For M =1 (first-order Markovian) we prove that all protocols can be simulated at Shannon's capacity. For M > 1 we characterize large classes of protocols that can be simulated at Shannon's capacity.",
author = "Assaf Ben-Yishai and Ofer Shayevitz and Kim, \{Young Han\}",
note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",
year = "2019",
month = jul,
doi = "10.1109/ISIT.2019.8849512",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2863--2867",
booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",
address = "الولايات المتّحدة",
}