Abstract
A new class of entropy functions of discrete systems, the class of concave entropies, is introduced. Each concave entropy function satisfies the fundamental axioms of general entropies. The Shannon and trigonometric entropies belong to the class of concave entropies. Each of the classes of Renyi and polynomial entropies contains a subclass of concave entropies. A sufficient condition is given, under which the total entropy tends to ∞, when the number N of probability components approaches ∞.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Behara, M., Polynomial entropy, Contributions to Econometrics and Statistics Today, Springer-Verlag, Berlin Heidelberg, 1985, pp. 46–51.
Behara, M. and Chorneyko, I. Z., On some trigonometric entropies, Journal of Orissa Mathematical Society (to appear).
Renyi, A., “Probability theory”, North-Holland, Amsterdam, 1970.
Royden, H. L., “Real Analysis”, McMillan New York; Collier-McMillan, London, 1968.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Behara, M., Dudek, Z. On concave entropies of discrete systems. Statistical Papers 31, 77–80 (1990). https://doi.org/10.1007/BF02924676
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02924676