Oct 21, 2021 · We show that for the Renyi information, In Sect. 3, the chain rule holds, and introduce a relationship to obtain the Renyi information rate.

Fano's lower bound on the probability of error to a family of lower and upper bounds based on Renyi's definitions of entropy and mutual information.

Abstract. Choosing the stochastic process with the entropy is attributable to increase the least amount of information to the problem under consideration. As a ...

A new classification method based on the negation of a basic probability assignment in the evidence theory · Computer Science, Mathematics. Engineering ...

Andai, A.: On the geometry of generalized Gaussian distributions. · Belis, M., Guiasu, S.: A quantitative-qualitative measure of information in cybernetics ...

Therefore, for the rate of 'useful' conditional Renyi information and also for an ergodic Markov chain, we will present a relationship and use it to extract the ...

Lower and upper bounds on the misclassification probability based on Renyi's information were given in [1] . Upper and lower bounds on the risk of an empirical ...

Markov chains differ by at least 1 bit ... Our bounds were derived for the asymptotic entropy rate, ... We have shown upper and lower bounds for Rényi entropy.

Dec 14, 2022 · The information measure that we consider in this paper is the dynamics of entanglement entropy between complementary subsystems. For a wide ...

It should also be noted that the estimators achieving the upper bounds in this paper are simple and run in time linear in the number of samples. Furthermore, ...