Arbitrarily Varying Channels with General Alphabets and States

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

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
Volume38
Issue number6
DOIs
Publication statusPublished - 1992

Fingerprint

interference
coding

Keywords

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

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Library and Information Sciences
  • Electrical and Electronic Engineering

Cite this

Arbitrarily Varying Channels with General Alphabets and States. / Csiszár, I.

In: IEEE Transactions on Information Theory, Vol. 38, No. 6, 1992, p. 1725-1742.

Research output: Contribution to journalArticle

@article{8f743d3ad14948b99dbd7be546550b68,
title = "Arbitrarily Varying Channels with General Alphabets and States",
abstract = "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.",
keywords = "Arbitrarily varying channel, capacity, continuous alphabet, simultaneous constraints, vector channel",
author = "I. Csisz{\'a}r",
year = "1992",
doi = "10.1109/18.165446",
language = "English",
volume = "38",
pages = "1725--1742",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Arbitrarily Varying Channels with General Alphabets and States

AU - Csiszár, I.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

KW - Arbitrarily varying channel

KW - capacity

KW - continuous alphabet

KW - simultaneous constraints

KW - vector channel

UR - http://www.scopus.com/inward/record.url?scp=0026955122&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026955122&partnerID=8YFLogxK

U2 - 10.1109/18.165446

DO - 10.1109/18.165446

M3 - Article

AN - SCOPUS:0026955122

VL - 38

SP - 1725

EP - 1742

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -