The AWGN Red Alert Problem
From MaRDI portal
Publication:2989309
DOI10.1109/TIT.2012.2235120zbMATH Open1364.94051arXiv1102.4411MaRDI QIDQ2989309FDOQ2989309
Authors: Bobak Nazer, Yanina Y. Shkel, Stark C. Draper 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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 discrete memoryless channels. This paper completely characterizes the optimal red alert exponent for additive white Gaussian noise channels with block power constraints.
Full work available at URL: https://arxiv.org/abs/1102.4411
Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)
Cited In (1)
This page was built for publication: The AWGN Red Alert Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989309)
