Probability of error, equivocation, and the Chernoff bound 论文
1970IEEE Transactions on Information Theory引用 324
Distributed Sensor Networks and Detection AlgorithmsWireless Communication Security TechniquesComputability, Logic, AI Algorithms
摘要
Relationships between the probability of error, the equivocation, and the Chernoff bound are examined for the two-hypothesis decision problem. The effect of rejections on these bounds is derived. Finally, the results are extended to the case of any finite number of hypotheses.