A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum ρ-th moment of the number of performed tasks are derived. The case where a sequence of tasks is produced by a source and n tasks are jointly described using nR bits is considered. If R is larger than ...

This paper discusses a possible program for improving the outer (converse) bounds on the finite-blocklength performance of multiple-access codes. The program is based on a certain conjecture involving Rényi entropy of a sum of two independent binary vectors. Some partial results towards showing the conjecture are presented. The problem of bounding the joint Rényi entropy in terms of the margina...

In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth Rényi entropy characterizes the optimal exponential moment of the codeword length. Index Terms ε source coding, exponential moment, the smooth Rényi entropy, ...

We consider the Rényi entropy function for weakly ψ-mixing systems. The first main result proves existence and regularity properties. The second main result of the paper is to get the decay rate for the large deviation of the return time to cylinder sets. We show it to be exponential with a rate given by the Rényi entropy function. Finally we also obtain bounds for the free energy.

We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdös-Rényi random graphs. Our main new result is the computation of the entropy, i.e. the leading order of the logarithm of the number of solutions, of matchings with a given size. We derive both an algorithm ...

The research of geometric means of matrices is attracting more and more attention from scholars since it has very important applications in mathematics and physics, especially in the von Neuman entropy involving the quantum physics and statistical thermal physical. There are many achievements on the entropy, among which the entropy uncertainty relation, the generalization of the Heisenberg unce...

where H(F)σ ≡ −Tr{σF log σF} is the von Neumann entropy of a state σF on system F and we unambiguously let ρC ≡ TrAB{ρABC} denote the reduced density operator on system C, for example. The CQMI captures the correlations present between Alice and Bob from the perspective of Charlie in the independent and identically distributed (i.i.d.) resource limit, where an asymptotically large number of cop...