Strong coordination over multi-hop line networks using channel resolvability codebooks

Badri N. Vellambi, Joerg Kliewer, Matthieu R. Bloch

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


We analyze the problem of strong coordination over a multi-hop line network in which the node initiating the coordination is a terminal network node. We assume that each node has access to a certain amount of randomness that is local to the node, and that the nodes also have shared common randomness, which are used together with explicit hop-by-hop communication to achieve information-theoretic strong coordination. We derive the trade-offs among the required rates of communication on the network links, the rates of local randomness available at network nodes, and the rate of common randomness to realize strong coordination. We present an achievable coding scheme built using multiple layers of channel resolvability codes, and establish several settings in which this scheme offers the best possible trade-offs among network resources.

Original languageEnglish (US)
Article number8093706
Pages (from-to)1132-1162
Number of pages31
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - Feb 2018

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Channel resolvability
  • Channel synthesis
  • Line network
  • Strong coordination


Dive into the research topics of 'Strong coordination over multi-hop line networks using channel resolvability codebooks'. Together they form a unique fingerprint.

Cite this