A Generalization of the Havrda-Charvat and Tsallis Entropy and Its Axiomatic Characterization
Authors:
Open Access
- 1 January 2014
- journal article
- research article
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-8
Abstract
In this communication, we characterize a measure of information of types,, andby taking certain axioms parallel to those considered earlier by Havrda and Charvat along with the recursive relation(;,,),;,,)(()),;,()),;,),,,,. Some properties of this measure are also studied. This measure includes Shannon’s information measure as a special case.
Keywords
Funding Information
- National Science Foundation (70831005, “985”, 20130181110063)
- National Science Foundation (70831005, “985”, 20130181110063)
- Program of Sichuan University “Innovative Research Base for Economic Development and Management,” (70831005, “985”, 20130181110063)
- Research Foundation of Ministry of Education for the Doctoral Program of Higher Education of China (70831005, “985”, 20130181110063)
This publication has 6 references indexed in Scilit:
- Comments on “Generalization of Shannon–Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy”IEEE Transactions on Information Theory, 2013
- Generalized entropies and logarithms and their duality relationsProceedings of the National Academy of Sciences, 2012
- A comprehensive classification of complex statistical systems and an axiomatic derivation of their entropy and distribution functionsEurophysics Letters, 2011
- Generalization of Shannon–Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive EntropyIEEE Transactions on Information Theory, 2004
- Possible generalization of Boltzmann-Gibbs statisticsJournal of Statistical Physics, 1988
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948