TY - GEN
T1 - Strong coordination with polar codes
AU - Bloch, Matthieu R.
AU - Luzzi, Laura
AU - Kliewer, Jorg
PY - 2012
Y1 - 2012
N2 - In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination.
AB - In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination.
UR - http://www.scopus.com/inward/record.url?scp=84875715192&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875715192&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2012.6483268
DO - 10.1109/Allerton.2012.6483268
M3 - Conference contribution
AN - SCOPUS:84875715192
SN - 9781467345385
T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
SP - 565
EP - 571
BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
T2 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Y2 - 1 October 2012 through 5 October 2012
ER -