Computer Science – Information Theory
Scientific paper
2005-11-21
Computer Science
Information Theory
Scientific paper
By replacing linear averaging in Shannon entropy with Kolmogorov-Nagumo average (KN-averages) or quasilinear mean and further imposing the additivity constraint, R\'{e}nyi proposed the first formal generalization of Shannon entropy. Using this recipe of R\'{e}nyi, one can prepare only two information measures: Shannon and R\'{e}nyi entropy. Indeed, using this formalism R\'{e}nyi characterized these additive entropies in terms of axioms of quasilinear mean. As additivity is a characteristic property of Shannon entropy, pseudo-additivity of the form $x \oplus_{q} y = x + y + (1-q)x y$ is a characteristic property of nonextensive (or Tsallis) entropy. One can apply R\'{e}nyi's recipe in the nonextensive case by replacing the linear averaging in Tsallis entropy with KN-averages and thereby imposing the constraint of pseudo-additivity. In this paper we show that nonextensive entropy is unique under the R\'{e}nyi's recipe, and there by give a characterization.
Bhatnagar Shalabh
Dukkipati Ambedkar
Murty Narasimha M.
No associations
LandOfFree
Uniqueness of Nonextensive entropy under Renyi's Recipe does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Uniqueness of Nonextensive entropy under Renyi's Recipe, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniqueness of Nonextensive entropy under Renyi's Recipe will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-291029