Probability of Error, Equivocation, and the Chernoff Bound

IEEE Transactions on Information Theory

Volumn 16, Issue 4, 1970, Pages 368-372

  Hellman, Martin E ^a   Raviv, Josef ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84915005479     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1970.1054466     Document Type: Article

References (15)

1. T. Kailath, “The divergence and Bhattacharyya distance in signal selection,” IEEE Trans. Communications Technology, vol. COM-15. pp. 52–60. February 1967.
2. H. Chernoff, “A. measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,” Ann. Math. Stat vol. 23, PP. 493–507, 1952.
3. H. Kobayashi and J. Thomas, “Distance measures and related criteria,” Proc, 6th Ann. Allerton Conf. on Circuits and Systems, (University of Illinois, Urbana), pp, 491–500, 1967.
4. S. M. Ali and S. D. Silvey, “A general class of coefficients. of divergence of one distribution from another,” J. Roy. Stat., vol. 28, pp. 131–142, 1966.
5. A. Rényi “On the amount of missing information and the Neyman-Pearson lemma,” in Festschrift for J. Neyman. New York: Wiley. 1966, pp. 281-288
6. A. Rényi, “On some basic problems of statistics from the point of view of information theory,” Proc, 5th Berkeley Symp. on Math. Stat. and Probability, vol. 1. Berkeley, Calif: University of California Press, 1967, pp. 531-543.
7. A. Rényi, “On the amount of information concerning an unknown parameter in a sequence of observations,” Magyar Tud. Akad. Mat. Kutató Int. Köyl vol. 9, pp. 617–625, 1965.
8. a. C. K. Chow, “An optimum character recognition system using decision functions,” IRE Trans. Electronic Computers, vol. EC-6, pp, 247–254, December 1957. b. C. K. Chow, “On optimum recognition error and reject tradeoff,” IBM Res. RC 2408 (11712); also IEEE Trans. Information - Theory, vol. IT-16, PP. 41–46, January 1970.
9. R. ASh, Information - Theory. New York: Interscience, 1965, pp. 8, 24.
10. R. Gallager, Information Theory and Reliable Communication. New York: Wiley 1968. pp. 520–521
11. C. Shannon, R. Gallaghér and E. Berlekamp, “Lower bounds to error probabilities for coding on discrete memory less channels-I” Inform. and Control. vol. 10, PP. 65-103, 1967.
12. G. D. Forney, “Exponential error bounds for erasure, list,. and decision feedback schemes,” IEEE Trans. Information Theory, vol. IT-14, pp. 206–220, March 1968.
13. J. Chu and J. Chueh “Inequalities. between Information measures and error probability,” J. Franklin Inst. vol. 282, pp. 121–125, August 1966.
14. J. Wozencraft and I. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965, p. 264.
15. H. Royden, Real Analysis. New York: Macmillan 1963 p. 76.