# Strong Coordination of Signals and Actions over Noisy Channels

## TL;DR

This paper introduces a random binning scheme for strong coordination over noisy channels, providing bounds on achievable distributions and the rate of common randomness needed for coordination.

## Contribution

It proposes a joint source-channel coding scheme for strong coordination with non-causal encoding and decoding, and characterizes the required common randomness rate.

## Key findings

- Inner and outer bounds for the strong coordination region
- Equivalent achievable distributions for empirical and strong coordination
- Quantification of common randomness rate needed

## Abstract

-We develop a random binning scheme for strong coordination in a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the set of achievable target distributions is the same as for empirical coordination, we characterize the rate of common randomness required for strong coordination.