Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-30T23:07:04.077Z Has data issue: false hasContentIssue false

Inaccuracy and a coding theorem

Published online by Cambridge University Press:  14 July 2016

Ram Autar
Affiliation:
University of Delhi
Raminder Singh Soni
Affiliation:
University of Delhi

Abstract

Kerridge introduced a measure known as inaccuracy for complete probability distributions which is the generalisation of Shannon's entropy. In this paper we study a grouping property of the inaccuracy. Also we have established a coding theorem for personal codes by considering inaccuracy of order a and generalised mean length of order t under the condition .

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1975 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Campbell, L. L. (1965) A coding theorem and Rényi's entropy. Inf. and Control 8, 423429.Google Scholar
[2] Feinstein, A. (1958) Foundations of Information Theory. McGraw-Hill, New York.Google Scholar
[3] Hardy, G. H. Littlewood, J. E. and Polya, G. (1952) Inequalities. Cambridge University Press.Google Scholar
[4] Kerridge, D. F. (1961) Inaccuracy and inference. J. R. Statist. Soc. B 23, 184194.Google Scholar
[5] Rényi, A. (1961) On measures of entropy and information. Proc. Fourth Berkeley Symp. Math. Statist. Prob. 1, 547561.Google Scholar
[6] Shannon, C. E. (1948) A mathematical theory of communication. Bell System Tech. J. 27, 379423.Google Scholar
[7] Sharma, B. D. (1970) The mean value study of quantities in information theory. Ph.D. Thesis, University of Delhi.Google Scholar