We introduce a novel parametric family of symmetric information-theoretic distances based on Jensen’s inequality for a convex functional generator. In particular, this family unifies the celebrated Jeffreys divergence with the Jensen-Shannon divergence when the Shannon entropy generator is chosen. We then design a generic algorithm to compute the unique centroid defined as the minimum average d...

The calculation of a statistical measure of complexity and the Fisher-Shannon information in nuclei is carried out in this work. We use the nuclear shell model in order to obtain the fractional occupation probabilities of nuclear orbitals. The increasing of both magnitudes, the statistical complexity and the Fisher-Shannon information, with the number of nucleons is observed. The shell structur...

BACKGROUND Studies comparing the measurement properties of EQ-5D 3L (3L) and EQ-5D 5L (5L) are limited to specific patient populations with small sample sizes. Using a general population sample, we compared 3L and 5L in terms of their measurement properties and association with number of chronic conditions, including multimorbidity--the concurrent occurrence of two or more chronic conditions. ...

It is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend ...

We tackle the problem of estimating the Shannon capacity of cycles of odd length. We present some strategies which allow us to nd tight bounds on the Shannon capacity of cycles of various odd lengths, and suggest that the diiculty of obtaining a general result may be related to diierent behaviours of the capacity, depending on the \structure" of the odd integer representing the cycle length. We...

Guesswork forms the mathematical framework for quantifying computational security subject to brute-force determination by query. In this paper, we consider guesswork subject to a per-symbol Shannon entropy budget. We introduce inscrutability rate to quantify the asymptotic difficulty of guessing U out of V secret strings drawn from the string-source and prove that the inscrutability rate of any...

Constraints on the entropy function are of fundamental importance in information theory. For a long time, the polymatroidal axioms, or equivalently the nonnegativity of the Shannon information measures, are the only known constraints. Inequalities that are implied by nonnegativity of the Shannon information measures are categorically referred to as Shannontype inequalities. If the number of ran...

It is the assertion of this paper that Informing Science (IS) framework (Cohen, 2009) gives insufficient attention to role of the client, a failing traced to the framework’s derivation from the Shannon-Weaver model of communication (Shannon & Weaver, 1949). The IS framework ignores developments in information and communication technology (ICT) and human rights and the resulting emergence of a c...

Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied by entropies (including the standard Shannon inequalities) and an additional inequality due to Ingleton. It is known that the Shannon and Ingleton inequalities generate all such linear rank inequalities on up to four variables, but it has been an open question whether additional inequalities hold for the case of five ...