Previous |  Up |  Next

Article

Title: Joint Range of Rényi entropies (English)
Author: Harremoës, Peter
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 45
Issue: 6
Year: 2009
Pages: 901-911
Summary lang: English
.
Category: math
.
Summary: The exact range of the joined values of several Rényi entropies is determined. The method is based on topology with special emphasis on the orientation of the objects studied. Like in the case when only two orders of the Rényi entropies are studied, one can parametrize the boundary of the range. An explicit formula for a tight upper or lower bound for one order of entropy in terms of another order of entropy cannot be given. (English)
Keyword: generalized Vandermonde determinant
Keyword: orientation
Keyword: Rényi entropies
Keyword: Shannon entropy
MSC: 62B10
MSC: 94A17
idZBL: Zbl 1186.94420
idMR: MR2650072
.
Date available: 2010-06-02T19:22:35Z
Last updated: 2013-09-21
Stable URL: http://hdl.handle.net/10338.dmlcz/140023
.
Reference: [1] E. Arikan: An inequality on guessing and its application to sequential decoding.IEEE Trans. Inform. Theory 42 (1996), 1, 99–105. Zbl 0845.94020, MR 1375330
Reference: [2] C. Arndt: Information Measures.Springer, Berlin 2001. Zbl 0973.94001, MR 1883988
Reference: [3] M. Ben-Bassat: $f$-entropies, probability of error, and feature selection.Inform. and Control 39 (1978), 227–242. Zbl 0394.94011, MR 0523439
Reference: [4] I. Csiszár: Generalized cutoff rates and Rényi information measures.IEEE Trans. Inform. Theory 41 (1995), 1, 26–34. MR 1366742
Reference: [5] M. Feder and N. Merhav: Relations between entropy and error probability.IEEE Trans. Inform. Theory 40 (1994), 259–266.
Reference: [6] J. D. Golić: On the relationship between the information measures and the Bayes probability of error.IEEE Trans. Inform. Theory 35 (1987), 5, 681–690. MR 0918190
Reference: [7] A. György and T. Linder: Optimal entropy-constrained scalar quantization of a uniform source.IEEE Trans. Inform. Theory 46 (2000), 7, 2704–2711. MR 1806836
Reference: [8] P. Harremoës and F. Topsøe: Inequalities between entropy and index of coincidence derived from information diagrams.IEEE Trans. Inform. Theory 47 (2001), 7, 2944–2960. MR 1872852
Reference: [9] P. Harremoës and I. Vajda: Efficiency of entropy testing.In: Internat. Symposium on Information Theory, pp. 2639–2643. IEEE 2008.
Reference: [10] P. Harremoës and I. Vajda: On the Bahadur-efficient testing of uniformity by means of the entropy.IEEE Trans. Inform. Theory 54 (2008), 1, 321–331. MR 2446756
Reference: [11] V. A. Kovalevskij: The Problem of Character Recognition from the Point of View of Mathematical Statistics.Spartan, New York 1967, pp. 3–30.
Reference: [12] J. W. Robbin and D. A. Salamon: The exponential Vandermonde matrix.Linear Algebra Appl. 317 (2000), 1–3, 225 – 226. MR 1782213
Reference: [13] W. Rudin: Principles of Mathematical Analysis.(Internat. Series in Pure and Applied Mathematics.) Third edition. McGraw-Hill, New York 1976. Zbl 0346.26002, MR 0385023
Reference: [14] E. H. Spanier: Algebraic Topology.Springer, Berlin 1982. Zbl 0810.55001, MR 0666554
Reference: [15] D. L. Tebbe and S. J. Dwyer: Uncertainty and the probability of error.IEEE Trans. Inform. Theory 14 (1968), 14, 516–518.
Reference: [16] K. Zyczkowski: Rényi extrapolation of Shannon entropy.Open Systems and Information Dynamics 10 (2003), 297–310. Zbl 1030.94022, MR 1998623
.

Files

Files Size Format View
Kybernetika_45-2009-6_2.pdf 1.158Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo