Empirical and Strong Coordination via Soft Covering with Polar Codes

Document Type

Article

Publication Date

7-1-2018

Abstract

We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequences of actions taking value in an alphabet of prime cardinality. Our results improve previously known polar coding schemes, which (i) were restricted to uniform distributions and to actions obtained via binary symmetric channels for strong coordination, (ii) required a non-negligible amount of common randomness for empirical coordination, and (iii) assumed that the simulation of discrete memoryless channels could be perfectly implemented. As a by-product of our results, we obtain a polar coding scheme that achieves channel resolvability for an arbitrary discrete memoryless channel whose input alphabet has prime cardinality.

Identifier

85044341179 (Scopus)

Publication Title

IEEE Transactions on Information Theory

External Full Text Location

https://doi.org/10.1109/TIT.2018.2817519

ISSN

00189448

First Page

5087

Last Page

5100

Issue

7

Volume

64

Grant

1320304

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS