COMPLETE CLASS OF MINIMAX AND MAXIMIN ENCODER-DECODER POLICIES FOR COMMUNICATION CHANNELS WITH INCOMPLETE STATISTICAL DESCRIPTION.

Tamer Basar, Ying Wah Wu

Research output: Contribution to conferencePaper

Abstract

We consider the problem of transmission of a sequence of i. i. d. Gaussian random variables over a channel whose statistical description is incomplete. The channel is modeled as one which 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 we obtain a complete set of solutions 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.

Original languageEnglish (US)
Pages373-377
Number of pages5
StatePublished - Dec 1 1984

Fingerprint

Random variables
Transmitters

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@conference{772037e1b866488592f13e53127800b2,
title = "COMPLETE CLASS OF MINIMAX AND MAXIMIN ENCODER-DECODER POLICIES FOR COMMUNICATION CHANNELS WITH INCOMPLETE STATISTICAL DESCRIPTION.",
abstract = "We consider the problem of transmission of a sequence of i. i. d. Gaussian random variables over a channel whose statistical description is incomplete. The channel is modeled as one which 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 we obtain a complete set of solutions 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.",
author = "Tamer Basar and Wu, {Ying Wah}",
year = "1984",
month = "12",
day = "1",
language = "English (US)",
pages = "373--377",

}

TY - CONF

T1 - COMPLETE CLASS OF MINIMAX AND MAXIMIN ENCODER-DECODER POLICIES FOR COMMUNICATION CHANNELS WITH INCOMPLETE STATISTICAL DESCRIPTION.

AU - Basar, Tamer

AU - Wu, Ying Wah

PY - 1984/12/1

Y1 - 1984/12/1

N2 - We consider the problem of transmission of a sequence of i. i. d. Gaussian random variables over a channel whose statistical description is incomplete. The channel is modeled as one which 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 we obtain a complete set of solutions 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.

AB - We consider the problem of transmission of a sequence of i. i. d. Gaussian random variables over a channel whose statistical description is incomplete. The channel is modeled as one which 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 we obtain a complete set of solutions 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.

UR - http://www.scopus.com/inward/record.url?scp=0021572738&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021572738&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0021572738

SP - 373

EP - 377

ER -