The Arbitrarily Varying Relay Channel

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

Abstract

We study the arbitrarily varying relay channel, and establish the cutset bound, decode-forward bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider deterministic coding schemes, and derive the deterministic code capacity, under certain conditions.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
Pages461-465
Number of pages5
DOIs
StatePublished - 15 Aug 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June

Conference

Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/TerritoryUnited States
CityVail
Period17/06/1822/06/18

Keywords

  • Arbitrarily varying channel
  • Decode-forward
  • Deterministic code
  • Markov block code
  • Minimax theorem
  • Random code
  • Relay channel
  • Symmetrizability

All Science Journal Classification (ASJC) codes

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

Cite this