CAPACITY AND DECODING RULES FOR CLASSES OF ARBITRARILY VARYING CHANNELS
CAPACITY AND DECODING RULES FOR CLASSES OF ARBITRARILY VARYING CHANNELS
复制标题
DOI：
10.1109/18.32153
复制
发表时间：
1989-07-01
影响因子：
2.5
通讯作者：
NARAYAN, P
中科院分区：
文献类型：
--
作者：
CSISZAR, I;NARAYAN, P
任意变化信道（AVC）的容量被认为是确定性代码的平均错误概率准则，通常，在状态约束。首先，充分的条件，使相对简单的解码规则，如典型性，最大互信息，和最小的距离，以达到容量。然后，（可能有噪声）或通道和组加法器通道进行了详细的研究。对于前者的容量是明确确定的，并示出可通过最小距离解码。接下来，对于一大类上瘾的AVC，除了提供一般AVC容量公式的直观暗示性简化之外，还证明了容量可以通过通用解码规则来获得。最后，研究了随机状态选择对系统容量的影响。以前的互信息博弈方法的优点和局限性进行了讨论。<>
The capacity of an arbitrarily varying channel (AVC) is considered for deterministic codes with the average probability of error criterion and, typically, subject to at state constraint. First, sufficient conditions are provided that enable relatively simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of addictive AVCs, in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, it is proven that capacity can be attained by a universal decoding rule. Finally, the effect of random state selections on capacity is studied. The merits and limitations of a previous mutual information game approach are also discussed.<>