Empirical and strong coordination via soft covering with polar codes

No Thumbnail Available
Issue Date
2018-07
Authors
Chou, Rémi
Bloch, Matthieu R.
Kliewer, Jorg
Advisor
Citation

Chou, Remi; Bloch, Matthieu R.; Kliewer, Jorg. 2018. Empirical and strong coordination via soft covering with polar codes. IEEE Transactions on Information Theory, vol. 64:no. 7:pp 5087-5100

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.

Table of Content
Description
Click on the DOI link to access the article (may not be free).
publication.page.dc.relation.uri