This paper introduces a new class of fractal dimension measures which we call relative multifractal measures. The relative multifractal measures developed are formed through a melding of the Rényi dimension spectrum, which is based on the Rényi generalized entropy, and relative entropy as given with the Kullback-Leibler distance. This new class of multifractal measures is then used to find the ...

The Shannon entropy is a widely used summary statistic, for example, network traffic measurement, anomaly detection, neural computations, spike trains, etc. This study focuses on estimating Shannon entropy of data streams. It is known that Shannon entropy can be approximated by Rényi entropy or Tsallis entropy, which are both functions of the αth frequency moments and approach Shannon entropy a...

We adopt L1 distance as Eve’s distinguishability in secret key generation from a common random number without communication. Under this secrecy criterion, using the Rényi entropy of order 1 + s for s ∈ [0, 1], we derive a new upper bound of Eve’s distinguishability under the application of the universal2 hash function. It is also shown that this bound gives the tight exponential decreasing rate...

Information theoretic cryptography is discussed based on conditional Rényi entropies. Our discussion focuses not only on cryptography but also on the definitions of conditional Rényi entropies and the related information theoretic inequalities. First, we revisit conditional Rényi entropies, and clarify what kind of properties are required and actually satisfied. Then, we propose security criter...

In this paper, we explore the issue of network infrastructure and architecture in Deep Space Communication Networks (DSCNs). Firstly, we present a typical structural sample infrastructure of our vision of DSCNs by separating the whole network into three major parts. We then use hypergraph theory and Rényi entropy paradigm to formulate Relaying Networks for Deep Space Communications (RNDSC) as a...

We derive a new upper bound for Eve’s information in secret key generation from a common random number without communication. This bound improves on Bennett[7]’s bound based on the Rényi entropy of order 2 because the bound obtained here uses the Rényi entropy of order 1+s for s ∈ [0, 1]. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve’s informati...

Second order lower bounds for the entropy function expressed in terms of the index of coincidence are derived. Equivalently, these bounds involve entropy and Rényi entropy of order 2. The constants found either explicitly or implicitly are best possible in a natural sense. The inequalities developed originated with certain problems in universal prediction and coding which are briefly discussed.

In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source coding, we establish the optimal (minimum) rate of compression of the source to ensure that the remaining uncertainties vanish. We also study the exponential rat...

The definition of weighted entropy allows for easy calculation of the entropy of the mixture of measures. In this paper we investigate the problem of equivalent definition of the general entropy function in weighted form. We show that under reasonable condition, which is satisfied by the well-known Shannon, Rényi and Tsallis entropies, every entropy function can be defined equivalently in the w...

Entropy-based divergence measures have shown promising results in many areas of engineering and image processing. In this paper, we define a new generalized divergence measure, namely, the Jensen–Rényi divergence. Some properties such as convexity and its upper bound are derived. Based on the Jensen–Rényi divergence, we propose a new approach to the problem of image registration. Some appealing...