Computer Science – Information Theory
Scientific paper
2007-07-19
Computer Science
Information Theory
14 pages, 5 figures, submitted to the IEEE Transactions on Information Theory, July 2007, revised April 2008
Scientific paper
This paper considers the design of a minimax test for two hypotheses where the actual probability densities of the observations are located in neighborhoods obtained by placing a bound on the relative entropy between actual and nominal densities. The minimax problem admits a saddle point which is characterized. The robust test applies a nonlinear transformation which flattens the nominal likelihood ratio in the vicinity of one. Results are illustrated by considering the transmission of binary data in the presence of additive noise.
No associations
LandOfFree
Robust Hypothesis Testing with a Relative Entropy Tolerance 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 Robust Hypothesis Testing with a Relative Entropy Tolerance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Hypothesis Testing with a Relative Entropy Tolerance will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-545165