Polar codes for empirical coordination over noisy channels with strictly causal encoding

TL;DR

This paper introduces a polar coding scheme for empirical coordination in a two-node noisy network, demonstrating that it achieves the coordination region with minimal common randomness under strictly causal encoding.

Contribution

It presents a novel polar code-based method for empirical coordination over noisy channels with strictly causal encoding, expanding the application of polar codes in network information theory.

Findings

Polar codes achieve the empirical coordination region.

Coordination is possible with vanishing common randomness.

Method applies to strictly causal encoding scenarios.

Abstract

In this paper, we propose a coding scheme based on polar codes for empirical coordination of autonomous devices. We consider a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of strictly causal encoding, we show that polar codes achieve the empirical coordination region, provided that a vanishing rate of common randomness is available.