×

zbMATH — the first resource for mathematics

On an axiomatic characterization of entropy of order \(\alpha\) (theoretic measure). (English) Zbl 0424.94004
MSC:
94A17 Measures of information, entropy
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] L. L. Campbell: Characterization of entropy of probability distributions on real lines. Information and control 21 (1972), 329-338. · Zbl 0245.94012
[2] A. Hobson: A new theorem of information theory. J. Stat. Phys. 1 (1969), 383-391.
[3] P. L. Kannappan: On Shannon entropy, directed divergence and inaccuracy. Z. Wahrs. verw. Geb. 22 (1972), 95-100. · Zbl 0241.94020
[4] S. Kullback: Information theory and statistics. Dover Publications, Inc., New York (1959). · Zbl 0088.10406
[5] P. N. Rathie P. L. Kannappan: A directed divergence function of type \(\beta\). Information and Control 20 (1972), 38-45. · Zbl 0231.94015
[6] A. Rényi: On measures of entropy and informations. Proc. 4th Berkley Symposium on Probability and Stat., Berkley 1961, Vol. 1, 547-561.
[7] B. D. Sharma R. Autar: Relative information functions and their type (\(\alpha\), \(\beta\)). Generalizations. Metrika 21 (1973). · Zbl 0277.94012
[8] B. D. Sharma I. J. Taneja: On axiomatic characterization of information-theoretic measures. J. Statist. Phys. 10 (1974), 4, 337-346.
[9] I. Vajda: On the amount of information contained in a sequence of independent observations. Kybernetika 6 (1970), 4, 306-324. · Zbl 0202.17802
[10] I. Vajda: Limit theorem for total variation of Cartesian product measures. Studia Scientiarum Mathematicarum Hungarica 6 (1971), 317-333. · Zbl 0243.62034
[11] C. T. Ng: Representation for measures of information with the branching property. Information and Control 25 (1974), 45-56. · Zbl 0279.94018
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.