Arbitrarily varying channels with general alphabets and states

Previous results of Csiszar and Narayan (1988, 1989, 1991) 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 det...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 38; no. 6; pp. 1725 - 1742
Main Author Csiszar, I.
Format Journal Article
LanguageEnglish
Published IEEE 01.11.1992
Subjects
Additive noise
Automatic voltage control
Capacity planning
Channel capacity
Codes
Conferences
Decoding
Gaussian noise
Information theory
Interference constraints
Online AccessGet full text
ISSN0018-9448
DOI10.1109/18.165446

Cover

More Information
Summary:Previous results of Csiszar and Narayan (1988, 1989, 1991) 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, the capacity for deterministic codes is shown to be equal to the random coding capacity if the input power exceeds the power of the deterministic interference, and zero otherwise. Explicit capacity formulas are also given.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
DOI:10.1109/18.165446