The Capacity of the Arbitrarily Varying Channel Revisited: Positivity, Constraints

Research output: Contribution to journalArticle

187 Citations (Scopus)

Abstract

A well-known result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the A VC is symmetrizable. The capacity of the A VC is also determined with constraints on the transmitted codewords as well as on the channel state sequences, and it is demonstrated that it may be positive but less than the corresponding random code capacity. A special case of the results resolves a weakened version of a fundamental problem of coding theory.

Original languageEnglish
Pages (from-to)181-193
Number of pages13
JournalIEEE Transactions on Information Theory
Volume34
Issue number2
DOIs
Publication statusPublished - Mar 1988

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'The Capacity of the Arbitrarily Varying Channel Revisited: Positivity, Constraints'. Together they form a unique fingerprint.

  • Cite this