Arbitrarily Varying Channels with General Alphabets and States

Research output: Contribution to journalArticle

40 Citations (Scopus)


Previous results of Csiszar and Narayan on the capacity of discrete arbitrarily varying channels with input and state constraints are extended to the case of arbitrary alphabets and state sets. For channels with scalar or vector inputs and additive interference consisting of a deterministic part and noise, both arbitrarily varying subject to power constraints, capacity for deterministic codes is shown to equal random coding capacity if the input power exceeds the power of the deterministic interference, and zero otherwise. Explicit capacity formulas are also given.

Original languageEnglish
Pages (from-to)1725-1742
Number of pages18
JournalIEEE Transactions on Information Theory
Issue number6
Publication statusPublished - Nov 1992



  • Arbitrarily varying channel
  • capacity
  • continuous alphabet
  • simultaneous constraints
  • vector channel

ASJC Scopus subject areas

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

Cite this