DeepAI AI Chat
Log In Sign Up

On the Common Randomness Capacity of a Special Class of Two-way Channels

by   Saeed Hajizadeh, et al.

In this paper, we would like to study the common randomness (CR) capacity of intertwined two-way channels, namely those whose marginal channel transition probabilities depends also on the signal they transmit. We bring a few special settings and provide constructive schemes with which the two nodes can agree upon a common randomness. We then provide an outer bound on the CR capacity of intertwined receiver-decomposable (RD) two-way channel and will provide a bound on the cardinality of the available auxiliary variables. We will also show this outer bound is bounded above by Venkatesan-Anantharam CR capacity which makes it tight for decomposing two-way setting.


page 1

page 2

page 3

page 4


A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity

We consider a standard two-source model for uniform common randomness (U...

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...

A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results

Channel symmetry properties that imply the tightness of Shannon's random...

Byzantine Multiple Access Channels – Part II: Communication With Adversary Identification

We introduce the problem of determining the identity of a byzantine user...

A General Formula for Uniform Common Randomness Capacity

We generalize the uniform common randomness capacity formula, initially ...

Common Randomness Generation from Gaussian Sources

We study the problem of common randomness (CR) generation in the basic t...

The Gaussian Interference Channel in the Presence of Malicious Jammers

This paper considers the two-user Gaussian interference channel in the p...