DeepAI AI Chat
Log In Sign Up

Computability of the Zero-Error Capacity of Noisy Channels

by   Holger Boche, et al.

Zero-error capacity plays an important role in a whole range of operational tasks, in addition to the fact that it is necessary for practical applications. Due to the importance of zero-error capacity, it is necessary to investigate its algorithmic computability, as there has been no known closed formula for the zero-error capacity until now. We show that the zero-error capacity of noisy channels is not Banach-Mazur computable and therefore not Borel-Turing computable. We also investigate the relationship between the zero-error capacity of discrete memoryless channels, the Shannon capacity of graphs, and Ahlswede's characterization of the zero-error-capacity of noisy channels with respect to the maximum error capacity of 0-1-arbitrarily varying channels. We will show that important questions regarding semi-decidability are equivalent for all three capacities. So far, the Borel-Turing computability of the Shannon capacity of graphs is completely open. This is why the coupling with semi-decidability is interesting. We further show that the Shannon capacity of graphs is Borel-Turing computable if and only if the maximum error capacity of 0-1 arbitrarily varying channels is Borel-Turing computable. Finally, we show that the average error capacity of 0-1 arbitrarily varying channels is Borel-Turing computable.


page 1

page 2

page 3

page 4


Computability of the Zero-Error capacity with Kolmogorov Oracle

The zero-error capacity of a discrete classical channel was first define...

Computability of the Channel Reliability Function and Related Bounds

The channel reliability function is an important tool that characterizes...

Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties

The capacity of finite state channels (FSCs) with feedback has been show...

On the Semi-Decidability of Remote State Estimation and Stabilization via Noisy Communication Channels

We consider the task of remote state estimation and stabilization of dis...

On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel

We study the problem of communicating over a discrete memoryless two-way...

Commitment over Gaussian Unfair Noisy Channels

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