Coset codes for compound multiple access channels with common information

Hideki Yagi, H. Vincent Poor

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

1 Scopus citations

Abstract

This paper considers code construction for arbitrar̃ discrete memoryless compound multiple access channels (MACs with common information. This class of channels includes a MA with/without common messages or with partially cooperating encoders. A construction method of code ensem bles based on coset codes is proposed for these channels. Assuming joint maximurn likelihood decoding, the performance of the proposed code ensem ble is analyzed by deriving error exponents. A condition is shown such that codes achieve the capacity region on average. The result obtained here reduces to the result of Slepian and Wolf or other conventional works if restricted to a single MAC. A combination of good linear codes gives capacity achieving codes for compound MACs with common messages or with partially cooperating encoders.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages1854-1858
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

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

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Coset codes for compound multiple access channels with common information'. Together they form a unique fingerprint.

  • Cite this

    Yagi, H., & Poor, H. V. (2009). Coset codes for compound multiple access channels with common information. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 1854-1858). [5205439] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205439