The AWGN Red Alert Problem

Details The AWGN Red Alert Problem The AWGN Red Alert Problem

2011-02-22

arxiv.org/abs/1102.4411v2

Computer Science

Information Theory

20 pages, 10 figures, Revised manuscript sent to IEEE Transactions on Information Theory

Scientific paper

Consider the following unequal error protection scenario. One special message, dubbed the "red alert" message, is required to have an extremely small probability of missed detection. The remainder of the messages must keep their average probability of error and probability of false alarm below a certain threshold. The goal then is to design a codebook that maximizes the error exponent of the red alert message while ensuring that the average probability of error and probability of false alarm go to zero as the blocklength goes to infinity. This red alert exponent has previously been characterized for any discrete memoryless channel operating at capacity and for the binary symmetric channel at any rate. This paper completely characterizes the optimal red alert exponent for additive white Gaussian noise channels with block power constraints.

Affiliated with

Also associated with

No associations

Rating

The AWGN Red Alert Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The AWGN Red Alert Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The AWGN Red Alert Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558250