Arbitrarily varying channels with general alphabets and states

Author

Csiszar, Imre

Author_Institution

Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary

Volume

38

Issue

6

fYear

1992

fDate

11/1/1992 12:00:00 AM

Firstpage

1725

Lastpage

1742

Abstract

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

Keywords

channel capacity; encoding; information theory; interference (signal); additive interference; arbitrary alphabets; arbitrary state sets; deterministic codes; discrete arbitrarily varying channels; general alphabets; noise; power constraints; random coding capacity; scalar inputs; vector inputs; Additive noise; Automatic voltage control; Capacity planning; Channel capacity; Codes; Conferences; Decoding; Gaussian noise; Information theory; Interference constraints;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.165446

Filename

165446