Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
复制标题
具有部分未知噪声的信道的信息容量。
DOI：
--
复制
发表时间：
1996
影响因子：
1.9
通讯作者：
I. Chao
中科院分区：
文献类型：
--
作者：
C. Baker;I. Chao
考虑了有限维通信信道的信息容量，其中噪声是已知的高斯噪声和具有未知统计特性的独立分量的和。该问题被建模为编码者和干扰者之间的零和二人博弈，以互信息作为支付函数。干扰机不控制环境高斯噪声。所采用的约束适合于扩展到无限维信道和考虑编码容量。对原问题进行了重新表述，证明了鞍值和鞍点的存在性。确定了鞍点值和鞍点，以及干扰机的极大极小策略。
Information capacity is considered for a finite-dimensional communication channel in which the noise is the sum of a known Gaussian noise and an independent component with unknown statistical properties. The problem is modeled as a zero-sum two-person game between the coder and a jammer, with mutual information as the payoff function. The jammer does not control the ambient Gaussian noise. The constraints employed are appropriate for extension to infinite-dimensional channels and for consideration of coding capacity. The original problem is reformulated to prove existence of both a saddle value and a saddle point. The saddle value and a saddle point are determined, along with the jammer’s minimax strategy.