ARBITRARILY VARYING CHANNELS WITH GENERAL ALPHABETS AND STATES

被引：42

作者：

CSISZAR, I

机构：

[1] Mathematical Institute of the Hungarian Academy of Science, H-1364 Budapest

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 06期

基金：

匈牙利科学研究基金会;

关键词：

ARBITRARILY VARYING CHANNEL; CAPACITY; CONTINUOUS ALPHABET; SIMULTANEOUS CONSTRAINTS; VECTOR CHANNEL;

D O I：

10.1109/18.165446

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1725 / 1742

页数：18

共 16 条

[1]

AHLSWEDE R, 1979, Z WAHRSCHEINLICHKEIT, V44, P159

[2]

Aubin JP, 1979, MATH METHODS GAME EC

[3]

BILLINGSLEY P, 1969, CONVERGENCE PROBABIL

[4] THE CAPACITIES OF CERTAIN CHANNEL CLASSES UNDER RANDOM CODING [J].

BLACKWELL, D ;

BREIMAN, L ;

THOMASIAN, AJ .

ANNALS OF MATHEMATICAL STATISTICS, 1960, 31 (03) :558-567

[5] SOME INFORMATION THEORETIC SADDLEPOINTS [J].

BORDEN, JM ;

MASON, DM ;

MCELIECE, RJ .

SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1985, 23 (01) :129-143

[6] CAPACITY AND DECODING RULES FOR CLASSES OF ARBITRARILY VARYING CHANNELS [J].

CSISZAR, I ;

NARAYAN, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (04) :752-769

[7] ARBITRARILY VARYING CHANNELS WITH CONSTRAINED INPUTS AND STATES [J].

CSISZAR, I ;

NARAYAN, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (01) :27-34

[8]

CSISZAR I, 1991, IEEE T INFORM THEORY, V36, P18

[9]

CSISZAR I, 1983, IEEE T INFORM THEORY, V34, P181

[10]

CSISZAR I, 1981, INFORMATION THEORY C

← 1 2 →