On specificity and entropy measures.
On the algebraic structure of fuzzy sets of type 2
On the amount of information contained in a sequence of independent observations
On the asymptotic rate of non-ergodic information sources
On the coding theorem for decomposable discrete information channels. I
On the coding theorem for decomposable discrete information channels. II
On the Entropy and Inaccuracy of Similarly and Oppositely Ordered Discrete Probability Distributions (I).
On the existence of finite generators for invertible measure-preserving transformations
On the identification of a subclass of finite state channels and their capacity
On the Inequality ... .
On the Inequality ...pi f(pi) > piif(qi).
On the regularity condition for decomposable communication channels
On the stack-size of general tries
Digital trees or tries are a general purpose flexible data structure that implements dictionaries built on words. The present paper is focussed on the average-case analysis of an important parameter of this tree-structure, i.e., the stack-size. The stack-size of a tree is the memory needed by a storage-optimal preorder traversal. The analysis is carried out under a general model in which words are produced by a source (in the information-theoretic sense) that emits symbols. Under some natural assumptions...
On the Stack-Size of General Tries
Digital trees or tries are a general purpose flexible data structure that implements dictionaries built on words. The present paper is focussed on the average-case analysis of an important parameter of this tree-structure, i.e., the stack-size. The stack-size of a tree is the memory needed by a storage-optimal preorder traversal. The analysis is carried out under a general model in which words are produced by a source (in the information-theoretic sense) that emits symbols. Under some natural...
One-adhesive polymatroids
Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized.
Optimally approximating exponential families
This article studies exponential families on finite sets such that the information divergence of an arbitrary probability distribution from is bounded by some constant . A particular class of low-dimensional exponential families that have low values of can be obtained from partitions of the state space. The main results concern optimality properties of these partition exponential families. The case where is studied in detail. This case is special, because if , then contains all probability...
Order statistics and -entropy measures
K. M. Wong and S. Chen [9] analyzed the Shannon entropy of a sequence of random variables under order restrictions. Using -entropies, I. J. Taneja [8], these results are generalized. Upper and lower bounds to the entropy reduction when the sequence is ordered and conditions under which they are achieved are derived. Theorems are presented showing the difference between the average entropy of the individual order statistics and the entropy of a member of the original independent identically distributed...
Prädiktionsentropie der slowakischen Schrift
Properties of unique information
We study the unique information function defined by Bertschinger et al. within the framework of information decompositions. In particular, we study uniqueness and support of the solutions to the convex optimization problem underlying the definition of . We identify sufficient conditions for non-uniqueness of solutions with full support in terms of conditional independence constraints and in terms of the cardinalities of , and . Our results are based on a reformulation of the first order conditions...
Pruning and measures of uncertainty