Strong coordination over a line when actions are Markovian

We analyze the problem of strong coordination over a multi-hop line network when the actions to be generated by the nodes satisfy a Markov chain that is matched to the network topology. We devise and prove the optimality of two schemes that cover the portions of the capacity region corresponding to unlimited or no common randomness shared by all nodes.

[1]  Venkat Anantharam,et al.  Generating dependent random variables over networks , 2011, 2011 IEEE Information Theory Workshop.

[2]  Gerhard Kramer,et al.  Topics in Multi-User Information Theory , 2008, Found. Trends Commun. Inf. Theory.

[3]  Paul W. Cuff,et al.  Communication requirements for generating correlated random variables , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Amin Gohari,et al.  Channel Simulation via Interactive Communications , 2012, IEEE Transactions on Information Theory.

[5]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[6]  Jörg Kliewer,et al.  Strong coordination over a three-terminal relay network , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[7]  Paul W. Cuff,et al.  Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.

[8]  Jörg Kliewer,et al.  Strong coordination over multi-hop line networks , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[9]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[10]  Jörg Kliewer,et al.  Strong coordination over a line network , 2013, 2013 IEEE International Symposium on Information Theory.

[11]  Amin Gohari,et al.  Coordination via a relay , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.