A general approach to random coding for multi-terminal networks

Stefano Rini, Andrea Goldsmith

Research output: Contribution to conferencePaperpeer-review

9 Scopus citations


We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an "automatic rate region derivator" which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.

Original languageEnglish
Number of pages9
StatePublished - 16 May 2013
Event2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States
Duration: 10 Feb 201315 Feb 2013


Conference2013 Information Theory and Applications Workshop, ITA 2013
CountryUnited States
CitySan Diego, CA


  • achievable region
  • binning
  • chain graph
  • coded time-sharing
  • multi-terminal network
  • rate-splitting
  • superposition

Cite this