The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. For the AVMAC without constraints, the characterization due to Ahlswede and Cai is complete except for two cases, pointed out in the literature as an open problem. The missing piece is obtained as a special case of our results.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Pages445-449
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/TerritoryFrance
CityParis
Period7/07/1912/07/19

Keywords

  • Arbitrarily varying channel
  • deterministic code
  • minimax
  • multiple access
  • random code
  • symmerizability

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints'. Together they form a unique fingerprint.

Cite this