zbMATH — the first resource for mathematics

On axiomatic characterization of some non-additive measures of information. (English) Zbl 0361.94037

94A15 Information theory (general)
PDF BibTeX Cite
Full Text: DOI EuDML
[1] Aczel, J.: Lectures on Functional Equations and their Applications, New York 1966.
[2] Havrda, J., andF. Charvat: Quantification method of classification processes, the concept of structural {\(\alpha\)}-entropy. Kybernetika3, S. 30–35, 1967. · Zbl 0178.22401
[3] Kapur, J.N.: Generalized entropy of order {\(\alpha\)} and type {\(\beta\)}. Math. Seminar, Delhi4, S. 78–94, 1967. · Zbl 0153.48601
[4] Kerridge, D.F.: Inaccuracy and Inference, J. Royal Stat. Soc. B,23, S. 184–194, 1961. · Zbl 0112.10302
[5] Kullback, S.: Information Theory and Statistics, Inc. New York 1959. · Zbl 0088.10406
[6] Nath, P.: Some Axiomatic characterization of a non-additive measures of Divergence in Information, R.S. Varma memo. Vol. Jou. Math. Sci. S. 157–168, 1972.
[7] Mathai, A.M., andP.N. Rathie: Axiomatic Foundation of some basic concept in Information Theory and Statistics.
[8] Renyi, A.: On measures of entropy and information, Proc. 4th Berk. Symp. Math. Stat. and Prob.1, S. 547–561, 1961.
[9] Shannon, C.E.: A mathematical theory of communication, Bel Sys. Tech. J.27, S. 379–423, S. 623–656, 1948. · Zbl 1154.94303
[10] Shannon, C.E., andW. Weaver: The mathematical theory of Communication, University of Illinois Press, 1949. · Zbl 0041.25804
[11] Sharna, B.D., andR. Autar: On characterization of a generalized inaccuracy measure in Information Theory. Jour. of Applied Prob. 10, S. 464–468, 1973. · Zbl 0261.94024
[12] Vajda, I.: Axioms for {\(\alpha\)}-entropy of a Generalized Probability Scheme. Kybernetika Vol.4, S. 105–112, 1968. · Zbl 0193.48201
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.