On the capacity region of a multiple access channel with common messages

D. Gündüz, O. Simeone

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

The capacity region for a multiple access channel (MAC) with arbitrary sets of common messages was derived by Han in 1979, extending a result by Slepian and Wolf from 1973. The general characterization by Han involves one auxiliary random variable per message and one inequality per subset of messages. In this paper, at first, a special hierarchy of common messages is identified for which the capacity region is characterized with generally fewer auxiliary random variables and inequalities. It is also shown that this characterization requires no auxiliary random variable for certain message structures. A procedure is then proposed to transform any common message structure to this special hierarchy, leading to a general capacity characterization which generally requires fewer auxiliary random variables than the one given by Han.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages470-474
Number of pages5
DOIs
StatePublished - Aug 23 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period6/13/106/18/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the capacity region of a multiple access channel with common messages'. Together they form a unique fingerprint.

Cite this