Next Article in Journal
Explainable AI: A Review of Machine Learning Interpretability Methods
Previous Article in Journal
An Optimality Summary: Secret Key Agreement with Physical Unclonable Functions
Article

On the Interactive Capacity of Finite-State Protocols

1
School of Computer Science and Engineering, Hebrew University of Jerusalem, Jerusalem 9190401, Israel
2
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA 92093 USA
3
Department of Computer Science, Tel Aviv University, Tel Aviv 6997801, Israel
4
Department of EE–Systems, Tel Aviv University, Tel Aviv 6997801, Israel
*
Author to whom correspondence should be addressed.
This paper was presented in part at the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 7–12 July 2019.
Entropy 2021, 23(1), 17; https://doi.org/10.3390/e23010017
Received: 3 December 2020 / Revised: 20 December 2020 / Accepted: 22 December 2020 / Published: 25 December 2020
(This article belongs to the Section Information Theory, Probability and Statistics)
The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known lower bounds are far below the associated Shannon capacity, which serves as a trivial (and also generally the best known) upper bound. This paper considers the more restricted setup of simulating finite-state protocols. It is shown that all two-state protocols, as well as rich families of arbitrary finite-state protocols, can be simulated at the Shannon capacity, establishing the interactive capacity for those families of protocols. View Full-Text
Keywords: interactive communication; Shannon theory; channel capacity interactive communication; Shannon theory; channel capacity
Show Figures

Figure 1

MDPI and ACS Style

Ben-Yishai, A.; Kim, Y.-H.; Oshman, R.; Shayevitz, O. On the Interactive Capacity of Finite-State Protocols. Entropy 2021, 23, 17. https://doi.org/10.3390/e23010017

AMA Style

Ben-Yishai A, Kim Y-H, Oshman R, Shayevitz O. On the Interactive Capacity of Finite-State Protocols. Entropy. 2021; 23(1):17. https://doi.org/10.3390/e23010017

Chicago/Turabian Style

Ben-Yishai, Assaf, Young-Han Kim, Rotem Oshman, and Ofer Shayevitz. 2021. "On the Interactive Capacity of Finite-State Protocols" Entropy 23, no. 1: 17. https://doi.org/10.3390/e23010017

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop