On the Interactive Capacity of Finite-State Protocols

12/31/2019
by   Assaf Ben-Yishai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2017

Shannon Capacity is Achievable for Binary Interactive First-Order Markovian Protocols

We address the problem of simulating an arbitrary binary interactive fir...
research
08/20/2019

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels

The interactive capacity of a channel is defined in this paper as the ma...
research
11/07/2017

Revisionist Simulations: A New Approach to Proving Space Lower Bounds

Determining the space complexity of x-obstruction-free k-set agreement f...
research
05/13/2022

Data-Driven Upper Bounds on Channel Capacity

We consider the problem of estimating an upper bound on the capacity of ...
research
08/11/2021

Shannon capacity, Chess, DNA and Umbrellas

A vexing open problem in information theory is to find the Shannon capac...
research
07/12/2023

Relative Fractional Independence Number and Its Applications

We define the relative fractional independence number of two graphs, G a...
research
05/11/2023

Commitment over Gaussian Unfair Noisy Channels

Commitment is a key primitive which resides at the heart of several cryp...

Please sign up or login with your details

Forgot password? Click here to reset