Arbitrarily Varying Channels with Constrained Inputs and States

I. Csiszár, Prakash Narayan

Research output: Contribution to journalArticle

53 Citations (Scopus)

Abstract

Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVC‧s) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints: peak (i.e., required for each m-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity, if the codewords and/or the channel state sequences are constrained in the average sense, the AVC's do not possess (strong) capacities; only e-capacities are shown to exist.

Original languageEnglish
Pages (from-to)27-34
Number of pages8
JournalIEEE Transactions on Information Theory
Volume34
Issue number1
DOIs
Publication statusPublished - 1988

Fingerprint

coding

ASJC Scopus subject areas

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

Cite this

Arbitrarily Varying Channels with Constrained Inputs and States. / Csiszár, I.; Narayan, Prakash.

In: IEEE Transactions on Information Theory, Vol. 34, No. 1, 1988, p. 27-34.

Research output: Contribution to journalArticle

@article{dea1be1786bd43769e4a4df4d8a986e1,
title = "Arbitrarily Varying Channels with Constrained Inputs and States",
abstract = "Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVC‧s) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints: peak (i.e., required for each m-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity, if the codewords and/or the channel state sequences are constrained in the average sense, the AVC's do not possess (strong) capacities; only e-capacities are shown to exist.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "1988",
doi = "10.1109/18.2598",
language = "English",
volume = "34",
pages = "27--34",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Arbitrarily Varying Channels with Constrained Inputs and States

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 1988

Y1 - 1988

N2 - Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVC‧s) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints: peak (i.e., required for each m-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity, if the codewords and/or the channel state sequences are constrained in the average sense, the AVC's do not possess (strong) capacities; only e-capacities are shown to exist.

AB - Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVC‧s) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints: peak (i.e., required for each m-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity, if the codewords and/or the channel state sequences are constrained in the average sense, the AVC's do not possess (strong) capacities; only e-capacities are shown to exist.

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

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

U2 - 10.1109/18.2598

DO - 10.1109/18.2598

M3 - Article

VL - 34

SP - 27

EP - 34

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -