Related Experiment Video
Updated: Nov 23, 2025

One Dimensional Turing-Like Handshake Test for Motor Intelligence
Published on: December 15, 2010
On the Interactive Capacity of Finite-State Protocols
Assaf Ben-Yishai1, Young-Han Kim2, Rotem Oshman3
1School of Computer Science and Engineering, Hebrew University of Jerusalem, Jerusalem 9190401, Israel.
This study determines the interactive capacity for finite-state protocols, showing they can be simulated reliably at the Shannon capacity. This resolves a long-standing challenge in information theory for specific protocol types.
Area of Science:
- Information Theory
- Computer Science
- Communication Systems
Background:
- Interactive capacity quantifies reliable simulation rates over noisy channels.
- Calculating interactive capacity is complex, with known bounds often far from the Shannon capacity.
- Existing upper bounds (Shannon capacity) are generally the best known but not tight for interactive protocols.
Purpose of the Study:
- To determine the interactive capacity for simulating finite-state protocols.
- To investigate if finite-state protocols can achieve the Shannon capacity for reliable simulation.
- To establish tighter bounds for interactive capacity in restricted settings.
Main Methods:
- Analysis of interactive protocols within a restricted finite-state model.
- Theoretical investigation of simulation rates over noisy communication channels.
- Comparison of achievable simulation rates against the Shannon capacity.
Main Results:
- All two-state protocols can be simulated reliably at the Shannon capacity.
- Rich families of arbitrary finite-state protocols also achieve the Shannon capacity.
- The interactive capacity is established for these specific classes of finite-state protocols.
Conclusions:
- The interactive capacity problem is solved for two-state and certain arbitrary finite-state protocols.
- Simulation at Shannon capacity is achievable for these protocols, bridging a gap in information theory.
- This work provides a significant advancement in understanding reliable communication over noisy channels.
More Related Videos
08:36Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms
Published on: March 21, 2019
07:43Author Spotlight: A Novel Setup to Conduct Naturalistic Laboratory Experiments with Real Human Actors in Scenarios
Published on: August 4, 2023
Related Concept Videos
Network Function of a Circuit
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
Transfer Function to State Space
In an RLC...
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
State Space Representation
Consider an RLC circuit, a...
Cyclic Processes And Isolated Systems
In the case of a non-isolated system, the change in the internal energy is zero only if the process is cyclic. A thermodynamic process is considered cyclic if the system undergoes a series of changes and returns to its initial state.
Consider a cyclic process that returns to its initial state, undergoing a four-step process. The heat transfer along each...