THE CAPACITY OF THE ARBITRARILY VARYING CHANNEL REVISITED - POSITIVITY, CONSTRAINTS

被引：213

作者：

CSISZAR, I ^{[1
]}

NARAYAN, P ^{[1
]}

机构：

[1] UNIV MARYLAND,DEPT ELECT ENGN,COLLEGE PK,MD 20742

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 02期

基金：

美国国家科学基金会;

关键词：

PROBABILITY - Random Processes;

D O I：

10.1109/18.2627

中图分类号：

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

学科分类号：

0812 ;

摘要：

A well-known result of R. Ahlswede (1970) asserts that the deterministic code capacity of an arbitrarily varying channel (AVC), under the average-error-probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity of the AVC is determined with constraints on the transmitted codewords as well as on the channel state sequences, and it is demonstrated that it may be positive but less than the corresponding random code capacity. A special case of the results resolves a weakened version of a fundamental problem of coding theory.

引用

页码：181 / 193

页数：13