Coset codes for compound multiple access channels with common information

Hideki Yagi, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Code construction is considered for arbitrary discrete memoryless compound multiple access channels (MACs) with common information. This class of channels includes MACs with/without common messages or with partially cooperating encoders. A construction method of code ensembles based on coset codes is proposed for these channels. Assuming joint maximum likelihood decoding, the performance of the proposed code ensemble is analyzed by deriving a lower bound on error exponents. A condition assuring that codes achieve the capacity region on average is given. It is seen that an elaborate combination of good linear codes gives capacity achieving codes for compound MACs with common messages or with partially cooperating encoders. The use of restricted ensembles with low-density parity check (LDPC) codes as component codes is also discussed. It is shown that a coset code ensemble based on nonbinary regular LDPC codes approaches the random coding exponent, and thus is capacity-achieving.

Original languageEnglish (US)
Article number5773074
Pages (from-to)3429-3448
Number of pages20
JournalIEEE Transactions on Information Theory
Volume57
Issue number6
DOIs
StatePublished - Jun 1 2011

All Science Journal Classification (ASJC) codes

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

Keywords

  • Code construction
  • common information
  • compound multiple access channel (CMAC)
  • encoder cooperation
  • low-density parity check (LDPC) code

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