Coding theorems on a non-additive generalized entropy of Havrda-Charvat and Tsallis (Q2895635)

The authors propose a modified measure of average code length, and derive a coding theorem by which the average code length is bounded by the Sharma-Mittal entropy [\textit{B. D. Sharma} and \textit{D. P. Mittal}, J. Math. Sci. 10(1975), 28--40 (1976; Zbl 0371.94039)]. The Sharma-Mittal entropy is a two-parameter entropy which, by special choice of the parameters, reduces to the Shannon [\textit{C. E. Shannon}, Bell Syst. Tech. J. 27, 379--423, 623--656 (1948; Zbl 1154.94303)], Rényi [\textit{A. Rényi}, Foundations of probability. San Francisco: Holden-Day (1970; Zbl 0203.49801)] or Havrda-Charvát [\textit{J. Havrda} and \textit{F. Charvát}, Kybernetika, Praha 3, 30--35 (1967; Zbl 0178.22401)] entropies. The authors recognize the connection and derive Shannon, Rényi and Havrda-Charvát coding theorems as special cases of the Sharma-Mittal coding theorem.NEWLINENEWLINE The paper is written in a clear way and a number of papers about coding theorems are cited. However, there is a lack of novelty, since a similar paper has been written before [\textit{P. Jain} and \textit{R. K. Tuteja}, Kybernetika 23, 420--427 (1987; Zbl 0637.94005)], although not explicitly mentioned in the paper's list of references.