The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...

the second law of thermodynamic (entropy principle) is of special theo-philosophical importance. it seems that this law, which is renowned as “the death of software design” and despite the order in the world, is like an incompatible universal. this article examines the concept of entropy in the three temperature, statistic, and information applications and addresses the contradiction of the sec...

The straightforward application of Shannon’s separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding ...

The channel capacity of a deterministic system with confidential data is an upper bound on the amount of bits of data an attacker can learn from the system. We encode all possible attacks to a system using a probabilistic specification, an Interval Markov Chain. Then the channel capacity computation reduces to finding a model of a specification with highest entropy. Entropy maximization for pro...

Intra-query parallelism is important for achieving high performance in parallel processing environment. For processing a signatrue file in parallel, an effective declustering algon’thm that must avoid data skew and execution skew is needed. The Linear Code Decomposition Method(LCDM) that is used for the Hamming filter may give a good performance, but it fails to evenly decluster a signature fil...

WC introduce a new zzrotree scheme that e&tively exploits the inter-scale self-similaritizs found in the octave decomposition hy a wavelet transform. :2 zerotreti is useful to code wavelet coefiicients and its 4&tiveness wa.q proved hy Shapiro’s I:%W. In the coding scheme. wavzlz~ uoellicients are symholizsd and then entropy-coded. ~fhe entropy per symbol is determined from the produced symbols...

The theoretical limits of ’lossy’ data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which discards all information that can be lost without altering the perception of the specified observer. The complexity of this macroscopically observed state is the simplest description of any microstate comprising that...

In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.

An entropy-constrained quantizer Q is optimal if it minimizes the expected distortion D(Q) subject to a constraint on the output entropy H(Q). In this paper we use the Lagrangian formulation to show the existence and study the structure of optimal entropy-constrained quantizers that achieve a point on the lower convex hull of the operational distortion-rate function D h (R) = inf Q fD(Q) : H(Q)...

The Shannon entropy is a standard measure for the order state of symbol sequences, such as, for example, DNA sequences. In order to incorporate correlations between symbols, the entropy of n-mers (consecutive strands of n symbols) has to be determined. Here, an assay is presented to estimate such higher order entropies (block entropies) for DNA sequences when the actual number of observations i...