论文信息 - Probability of error, equivocation, and the Chernoff bound

Probability of error, equivocation, and the Chernoff bound

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.

Martin E. Hellman | Josef Raviv | M. Hellman | J. Raviv

[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2] C. K. Chow,et al. An optimum character recognition system using decision functions , 1957, IRE Trans. Electron. Comput..

[3] I. M. Jacobs,et al. Principles of Communication Engineering , 1965 .

[4] J. T. Chu,et al. Inequalities between information measures and error probability , 1966 .

[5] S. M. Ali,et al. A General Class of Coefficients of Divergence of One Distribution from Another , 1966 .

[6] Alfréd Rényi,et al. On some basic problems of statistics from the point of view of information theory , 1967 .

[7] T. Kailath. The Divergence and Bhattacharyya Distance Measures in Signal Selection , 1967 .

[8] G. David Forney,et al. Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.