CAPACITY OF GENERAL TIME-DISCRETE CHANNEL WITH FINITE ALPHABET

被引：1

作者：

ZIV, J

机构：

[1] Scientific Department, Israel Ministry of Defence P.O.B.

来源：

INFORMATION AND CONTROL | 1969年 / 14卷 / 03期

关键词：

D O I：

10.1016/S0019-9958(69)90066-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, the capacity, C, of the general discrete time-varying channel with memory is derived. It is also demonstrated that for rates below some positive number Cs, the upper bound on the probability of of error decreases exponentially with the block length, n. (Clearly Cs ≦ C). The capacity C is derived by proving a coding theorem which is then followed by a (weak) converse theorem. © 1969 Academic Press, Inc.

引用

页码：233 / &