Probability of error, equivocation, and the Chernoff bound

1970/07/01 by Martin E. Hellman, J. Raviv · 4 citations
Computer Science · Engineering · #Distributed Sensor Networks and Detection Algorithms #Wireless Communication Security Techniques #Computability, Logic, AI Algorithms

paper · doi:10.1109/tit.1970.1054466

openalex publication_date 1970/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

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.

Citations

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Cited by

• Stochastic mutual information gradient estimation for dimensionality reduction networks
• Noise and Disturbance in Quantum Measurements: An Information-Theoretic Approach
• Effects of Interregional Travels and Vaccination in Infection Spreads\n Simulated by Lattice of SEIRS Circuits
• Conditional entropy [wikipedia]