Add to ORKGIn this paper we prove a new analytic inequality for logarithms and apply it for the Noiseless Coding Theorem
Bounds for the logarithmic function are studied. In particular, we\ud establish bounds with rational...
An improvement of the Noiseless Coding Theorem for certain\ud probability distributions is given
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is...
AbstractA new analytic inequality for logarithms which provides a converse to arithmetic meangeometr...
A new analytic inequality for logarithms which provides a converse to arithmetic mean-geometric mean...
In this paper we introduce a new type of the Hardy-Hilbert’s inequality\ud with logarithm. This allo...
Using the concavity property of the log mapping and the weighted arithmetic mean - geometric mean in...
Using an inequality for convex functions by Andrica and Ra°a [1] (2.1), we point out a new inequalit...
AbstractUsing an inequality for convex functions by Andrica and Ra°a [1] (2.1), we point out a new i...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
In this paper we discuss new inequalities for logarithmic mapping and apply them in Information Theo...
For a generalized random variable X, a measure L¯X of average code length is defined. Using L¯X, som...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
We present a relation between Tsallis’s entropy and generalized Kerridge inaccuracy which is called ...
Abstract. The coding theorem is a fundamental result of algorithmic information theory. A well known...
Bounds for the logarithmic function are studied. In particular, we\ud establish bounds with rational...
An improvement of the Noiseless Coding Theorem for certain\ud probability distributions is given
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is...
AbstractA new analytic inequality for logarithms which provides a converse to arithmetic meangeometr...
A new analytic inequality for logarithms which provides a converse to arithmetic mean-geometric mean...
In this paper we introduce a new type of the Hardy-Hilbert’s inequality\ud with logarithm. This allo...
Using the concavity property of the log mapping and the weighted arithmetic mean - geometric mean in...
Using an inequality for convex functions by Andrica and Ra°a [1] (2.1), we point out a new inequalit...
AbstractUsing an inequality for convex functions by Andrica and Ra°a [1] (2.1), we point out a new i...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
In this paper we discuss new inequalities for logarithmic mapping and apply them in Information Theo...
For a generalized random variable X, a measure L¯X of average code length is defined. Using L¯X, som...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
We present a relation between Tsallis’s entropy and generalized Kerridge inaccuracy which is called ...
Abstract. The coding theorem is a fundamental result of algorithmic information theory. A well known...
Bounds for the logarithmic function are studied. In particular, we\ud establish bounds with rational...
An improvement of the Noiseless Coding Theorem for certain\ud probability distributions is given
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is...