Coding theorem for discrete channel with zero-memory 离散无记忆信道编码定理
A new method for studying the average mutual information of binary symmetric discrete channel 一种研究二元对称离散信道(DCH)平均互信息的新方法
We use the synergetics to study how to allocate input probability in the binary symmetric discrete channel in order to maximize average mutual information for memoryless and memory channels with interference. 在有干扰(噪声)无记忆信道和有记忆信道两种情况下,运用协同学的方法研究如何分配输入概率获取二元对称离散信道(DCH)最大的平均互信息。
Discrete Channel Model and Information Gain of Test 测试的离散信道(DCH)模型与信息量
The capacity-cost function of discrete memoryless channel, and channel coding theorem. 离散无记忆信道的容量价值函数和信道编码定理。