메뉴 건너뛰기




Volumn 40, Issue 1, 1994, Pages 259-266

Relations Between Entropy and Error Probability

Author keywords

channel coding theorem; Entropy; equivocation; error probability; Fano's inequality; predictability

Indexed keywords

CODES (SYMBOLS); CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); ERROR ANALYSIS; MATHEMATICAL MODELS; PROBABILITY; SIGNAL FILTERING AND PREDICTION; SIGNAL THEORY;

EID: 0028273691     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.272494     Document Type: Article
Times cited : (187)

References (11)
  • 1
    • 49949133261 scopus 로고
    • Inequalities between information measures and error probability
    • Aug.
    • J. Chu and J Chueh, “Inequalities between information measures and error probability,” J. Franklin Inst., vol. 282, pp. 121-125, Aug. 1966.
    • (1966) J. Franklin Inst. , vol.282 , pp. 121-125
    • Chu, J.1    Chueh, J.2
  • 2
    • 0002396094 scopus 로고
    • Behavior of sequential predictors of binary sequences
    • T. M. Cover, “Behavior of sequential predictors of binary sequences,” in Proc. 4th Prague Conf. Inform. Theory, Statist. Decision Functions, Random Processes, 1965, Publishing House of the Czechoslovak Academy of Sciences, Prague, 1967, 263-272.
    • (1967) Proc. 4th Prague Conf. Inform. Theory
    • Cover, T.M.1
  • 3
    • 84947669128 scopus 로고
    • Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin
    • Oct.
    • “Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin,” Dep. of Statistics, Stanford Univ., Tech. Rep. 12, Oct. 1974.
    • (1974) Dep. of Statistics
  • 5
    • 84882281845 scopus 로고
    • Universal prediction of individual sequences
    • July
    • M. Feder, N. Merhav, and M. Gutman, “Universal prediction of individual sequences,” IEEE Trans. Inform. Theory, vol. 38, pp. 1258-1270, July 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 1258-1270
    • Feder, M.1    Merhav, N.2    Gutman, M.3
  • 6
    • 84939732350 scopus 로고
    • A simple derivation of the coding theorem and some applications
    • Jan.
    • R. G. Gallager, “A simple derivation of the coding theorem and some applications,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, Jan. 1965.
    • (1965) IEEE Trans. Inform. Theory , vol.IT-11 , pp. 3-18
    • Gallager, R.G.1
  • 7
    • 0003887760 scopus 로고
    • Information Theory and Reliable Communications
    • Wiley, New York
    • Information Theory and Reliable Communications. Wiley, New York: 1968.
    • (1968)
  • 8
    • 84915005479 scopus 로고
    • Probability of error, equivocation, and the Chernoff bound
    • July
    • M. E. Hellman and J. Raviv, “Probability of error, equivocation, and the Chernoff bound,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 368-372, July 1970.
    • (1970) IEEE Trans. Inform. Theory , vol.IT-16 , pp. 368-372
    • Hellman, M.E.1    Raviv, J.2
  • 10
    • 0000733254 scopus 로고
    • A new interpretation of information rate
    • J. L. Kelly, Jr., “A new interpretation of information rate,” Bell Syst. Tech. J., vol. 35, pp. 917-926, 1956.
    • (1956) Bell Syst. Tech. J. , vol.35 , pp. 917-926
    • Kelly, J.L.1
  • 11
    • 33747497952 scopus 로고
    • Information theory in cryptology
    • H. Yamamoto, “Information theory in cryptology,” IEICE Trans., vol. E-74, no. 9, pp. 2456-2464, 1991.
    • (1991) IEICE Trans. , vol.E-74 , Issue.9 , pp. 2456-2464
    • Yamamoto, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.