If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...

Land Use/Cover Change (LUCC) has gradually became an important direction in the research of global changes. LUCC is a complex system, and entropy is a measure of the degree of disorder of a system. According to land use information entropy, this paper analyzes changes in land use from the perspective of the system. Research on the entropy of LUCC structures has a certain “guiding role” for the ...

We give an elementary self-contained proof that the minimal entropy output of arbitrary products of channels ρ → 1 d−1 ½−ρ T is additive. This paper is concerned with efficiency of transmission of classical information through a particular quantum channel. Generally, the minimal entropy output of a general quantum channel Γ, given in terms of a completely positive trace-preserving map on the d-...

In this thesis we examine methods for measuring entanglement entropy in spin-1/2 Heisenberg systems using quantum Monte Carlo in the valence bond basis. We begin by presenting the quantum Monte Carlo techniques used in this research. We then use these techniques to directly compare the recently proposed valence bond entanglement entropy to the standard definition of entanglement entropy: the vo...

This paper presents a data-driven multiscale entropy measure to reveal the scale dependent information quantity of electroencephalogram (EEG) recordings. This work is motivated by the previous observations on the nonlinear and nonstationary nature of EEG over multiple time scales. Here, a new framework of entropy measures considering changing dynamics over multiple oscillatory scales is present...

A new measure called average code word length of order is defined and its relationship with Renyi's entropy of order is discussed. Using some coding theorems are proved under the condition Refer ences

The marriage of Renyi entropy with Parzen density estimation has been shown to be a viable tool in learning discriminative feature transforms. However, it suffers from computational complexity proportional to the square of the number of samples in the training data. This sets a practical limit to using large databases. We suggest immediate divorce of the two methods and remarriage of Renyi entr...

Abstract The marriage of Renyi entropy with Parzen density estimation has been shown to be a viable tool in learning discriminative feature transforms. However, it suffers from computational complexity proportional to the square of the number of samples in the training data. This sets a practical limit to using large databases. We suggest immediate divorce of the two methods and remarriage of R...