Joint coordination-channel coding for strong coordination over noisy channels based on polar codes

Document Type

Conference Proceeding

Publication Date

7-1-2017

Abstract

We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents X and Y, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions follows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DMC and shared randomness are together employed to simulate another DMC. In particular, our proposed solution is able to utilize the randomness of the DMC to reduce the amount of local randomness required to generate the sequence of actions at agent Y. By leveraging our earlier random coding results for this problem, we conclude that the proposed joint coordination-channel coding scheme strictly outperforms a separate scheme in terms of achievable communication rate for the same amount of injected randomness into both systems.

Identifier

85047911420 (Scopus)

ISBN

[9781538632666]

Publication Title

55th Annual Allerton Conference on Communication Control and Computing Allerton 2017

External Full Text Location

https://doi.org/10.1109/ALLERTON.2017.8262789

First Page

580

Last Page

587

Volume

2018-January

Grant

CCF-1439465

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS