arXiv · cond-mat/0403591
Information and coding discrimination of pseudo-additive entropies (PAE)
Abstract
PAE cannot be made a basis for either a generalized statistical mechanics or a generalized information theory. Either statistical independence must be waived, or the expression of the averaged conditional probability as the difference between the marginal and joint entropies must be relinquished. The same inequality, relating the PAE to the Rényi entropy, when applied to the mean code length produces an expression that it is without bound as the order of the code length approaches infinity. Since the mean code length associated with the Rényi entropy is finite and can be made to come as close to the Hartley entropy as desired in the same limit, the PAE have a more limited range of validity than the Rényi entropy which they approximate.
Explore related subjects
Keep this discovery
B. H. Lavenda. 2004-03-23. Information and coding discrimination of pseudo-additive entropies (PAE). https://arxiv.org/abs/cond-mat/0403591
Cite the original work for its findings. Save a collection to share your selection of sources.