Generalization of Shannon-Khinchin axioms to nonextensive systems and the uniqueness theorem for the nonextensive entropy

被引:53
作者
Suyari, H [1 ]
机构
[1] Chiba Univ, Dept Informat & Image Sci, Chiba 2638522, Japan
关键词
information measure; nonextensive entropy; nonextensive system; pseudoadditivity; Shannon additivity; Tsallis entropy;
D O I
10.1109/TIT.2004.831749
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Tsallis entropy, one-parameter generalization of Shannon entropy, has been often discussed in statistical physics as a new information measure. This new information measure has provided many satisfactory physical interpretations in nonextensive systems exhibiting chaos or fractal. We present the generalized Shannon-Khinchin axioms to nonextensive systems and prove the uniqueness theorem rigorously. Our results show that Tsallis entropy is the simplest among all nonextensive entropies. By the detailed comparisons of our axioms with the previously presented two sets of axioms, we reveal the peculiarity of pseudoadditivity as an axiom. In this correspondence, the most fundamental basis for Tsallis entropy as information measure is established in the information-theoretic framework.
引用
收藏
页码:1783 / 1787
页数:5
相关论文
共 11 条
[11]   Power-law sensitivity to initial conditions - New entropic representation [J].
Tsallis, C ;
Plastino, AR ;
Zheng, WM .
CHAOS SOLITONS & FRACTALS, 1997, 8 (06) :885-891