By Topic

A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The problem is considered of transmitting a sequence of independent and identically distributed Gaussian random variables over a channel whose statistical description is incomplete. The channel is modeled as one that is conditionally Gaussian, with the unknown part being controlled by a so-called "jammer" who may have access to the input to the encoder and operates under a given power constraint. By adopting a game-theoretic approach, a complete set of solutions is obtained (encoder and decoder mappings, and least-favorable distributions for the channel noise) for this statistical decision problem, under two different sets of conditions, depending on whether the encoder mapping is deterministic or stochastic. In the latter case, existence of a mixed saddle-point solution can be verified when a side channel of a specific nature is available between the transmitter and the receiver. In the former case, however, only minimax and maximin solutions can be derived.

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 4 )