Information Capacity of the Matched Gaussian Channel with Jamming. I. Finite-Dimensional Channel.

摘要

Information capacity is considered for the finite-dimensional additive Gaussian channel subject to jamming. The problem is modeled as a zero-sum two-person game with mutual information as payoff function. The jammer does not control the ambient Gaussian noise, which is not assumed negligible. The unique saddle point and saddle value are determined, along the jammer's minimax strategy. Keywords: Information capacity; Additive Gaussian channel; Mutual information; Minimax strategy. (JHD)