Strong Coordination over Noisy Channels with Strictly Causal Encoding

TL;DR

This paper investigates how two nodes can coordinate their signals over a noisy channel using strictly causal encoding, providing bounds and demonstrating the achievability with polar codes.

Contribution

It establishes inner and outer bounds for the strong coordination region under strict causal encoding and shows polar codes can achieve the inner bound.

Findings

Inner and outer bounds for the strong coordination region are derived.

Polar codes are shown to achieve the inner bound.

The results apply to networks with noisy channels and causal encoding.

Abstract

We consider 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 strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes.