zbMATH — the first resource for mathematics

Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Information theoretical properties of Tsallis entropies. (English) Zbl 1111.94008
Summary: A chain rule and a subadditivity for the entropy of type $\beta$, which is one of the nonadditive entropies, were derived by Daróczy. In this paper, we study the further relations among Tsallis type entropies which are typical nonadditive entropies. The chain rule is generalized by showing it for Tsallis relative entropy and the nonadditive entropy. We show some inequalities related to Tsallis entropies, especially the strong subadditivity for Tsallis type entropies and the subadditivity for the nonadditive entropies. The subadditivity and the strong subadditivity naturally lead to define Tsallis mutual entropy and Tsallis conditional mutual entropy, respectively, and then we show again chain rules for Tsallis mutual entropies. We give properties of entropic distances in terms of Tsallis entropies. Finally we show parametrically extended results based on information theory.
MSC:
 94A15 General topics of information theory 82B03 Foundations of equilibrium statistical mechanics 94A17 Measures of information, entropy