arXiv cs/06110382006-11-09cs.ITmath.IT

Nonsymmetric entropy I: basic concepts and results

Chengshi Liu

备注：: 5 pages

英文摘要：

A new concept named nonsymmetric entropy which generalizes the concepts of Boltzman's entropy and shannon's entropy, was introduced. Maximal nonsymmetric entropy principle was proven. Some important distribution laws were derived naturally from maximal nonsymmetric entropy principle.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A software for learning Information Theory basics with emphasis on Entropy of Spanish

In this paper, a tutorial software to learn Information Theory basics in a practical way is reported. The software, called IT-tutor-UV, makes use of a modern existing Spanish corpus for the modeling of the source. Both the source and the channel coding are also included in this educational tool as part of the learning experience. Entropy values of the Spanish language obtained with the IT-tutor-UV are discussed and compared to others that were previously calculated under limited conditions.

2007-09-20cs.ITmath.IT

Logical Entropy for Quantum States

The novel concept of quantum logical entropy is presented and analyzed. We prove several basic properties of this entropy with regard to density matrices. We hereby motivate a different approach for the assignment of quantum entropy to density matrices.

2014-12-27cs.ITmath.ITquant-ph

Basic inequalities for weighted entropies

The concept of weighted entropy takes into account values of different outcomes, i.e., makes entropy context-dependent, through the weight function. In this paper, we establish a number of simple inequalities for the weighted entropies (general as well as specific), mirroring similar bounds on standard (Shannon) entropies and related quantities. The required assumptions are written in terms of various expectations of the weight functions. Examples are weighted Ky Fan and weighted Hadamard inequalities involving determinants of positive-definite matrices, and weighted Cramér-Rao inequalities in…

2016-01-14cs.ITmath.ITmath.PR

Information Theoretic Proofs of Entropy Power Inequalities

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the EPI hinge on representations of differential entropy using either Fisher information or minimum mean-square error (MMSE), which are derived from de Bruijn's identity. In this paper, we first present an unified view of these proofs, showing that they share two essential ingredients: 1) a data processing argument applied to a covariance-preserving linear tran…

2010-08-24cs.ITmath.IT

The use of the logarithm of the variate in the calculation of differential entropy among certain related statistical distributions

This paper demonstrates that basic statistics (mean, variance) of the logarithm of the variate itself can be used in the calculation of differential entropy among random variables known to be multiples and powers of a common underlying variate. For the same set of distributions, the variance of the differential self-information is shown also to be a function of statistics of the logarithmic variate. Then entropy and its "variance" can be estimated using only statistics of the logarithmic variate plus constants, without reference to the traditional parameters of the variate.

2009-01-26cs.ITmath.IT

Analytical Bounds between Entropy and Error Probability in Binary Classifications

The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the closed-form solutions of conditional entropy without involving any approximation. Two basic types of classification errors are investigated in the context of binary classification problems, namely, Bayesian and non-Bayesian errors. We theoretically confirm that Fano's lower bound is an exact lower bound for any types of classifier in a relation diagram of "error…

2012-05-30cs.ITmath.IT

更多相关论文收起更多论文

Shannon and Renyi Entropy of Wavelets

This paper reports a new reading for wavelets, which is based on the classical 'De Broglie' principle. The wave-particle duality principle is adapted to wavelets. Every continuous basic wavelet is associated with a proper probability density, allowing defining the Shannon entropy of a wavelet. Further entropy definitions are considered, such as Jumarie or Renyi entropy of wavelets. We proved that any wavelet of the same family has the same Shannon entropy of its mother wavelet. Finally, the Shannon entropy for a few standard wavelet families is determined.

2015-04-04cs.ITmath.CAmath.IT

Algorithmic entropy, thermodynamics, and game interpretation

Basic relations for the mean length and algorithmic entropy are obtained by solving a new extremal problem. Using this extremal problem, they are obtained in a most simple and general way. The length and entropy are considered as two players of a new type of a game, in which we follow the scheme of our previous work on thermodynamic characteristics in quantum and classical approaches.

2011-05-01cs.ITmath-phmath.IT