论文信息 - Bounds on the entropy series

Bounds on the entropy series

Upper bounds on the entropy of a countable integer-valued random variable are furnished in terms of the expectation of the logarithm function. In particular, an upper bound is derived that is sharper than that of P. Elias (ibid., vol.IT-21, no.2, p.194-203, 1975), for all values of E/sub p/(log). Bounds that are better only for large values of E/sub p/ than the previous known upper bounds are also provided. >

Inder Jeet Taneja | Alfredo De Santis | Renato M. Capocelli

[1] Thomas M. Cover,et al. Some equivalences between Shannon entropy and Kolmogorov complexity , 1978, IEEE Trans. Inf. Theory.

[2] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .

[3] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[4] Aaron D. Wyner,et al. An Upper Bound on the Entropy Series , 1972, Inf. Control..

[5] Carlo Sempi,et al. Information theoretic interpretation of Forte's entropy for the grand canonical ensemble , 1983, ANNALI DELL UNIVERSITA DI FERRARA.