On a connection between information and group lattices
From MaRDI portal
Publication:657554
DOI10.3390/e13030683zbMath1229.94027OpenAlexW1972057797MaRDI QIDQ657554
Publication date: 9 January 2012
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e13030683
entropyisomorphismcommon informationsubgroup latticeinformation inequalityinformation elementinformation latticeinformation lawjoint information
Measures of information, entropy (94A17) Information theory (general) (94A15) Modular lattices, complemented lattices (06C99)
Related Items
Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Information-theoretic inequalities on unimodular Lie groups
- Recent progresses in characterising information inequalities
- Maximum entropy on compact groups
- Stochastic models, information theory, and Lie groups. Volume I: Classical results and geometric methods
- Every finite lattice can be embedded in a finite partition lattice
- Inequalities for Shannon entropy and Kolmogorov complexity
- Entropy and convergence on compact groups
- Stochastic calculus for finance. I: The binomial asset pricing model.
- On a new non-Shannon type information inequality
- The Shannon information of filtrations and the additional logarithmic utility of insiders
- On Sequences of Pairs of Dependent Random Variables
- Piecewise linear conditional information inequality
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- On Capacity of Line Networks
- Multiple access channels with arbitrarily correlated sources
- Polymatroidal dependence structure of a set of random variables
- Common randomness in information theory and cryptography. I. Secret sharing
- Common randomness in information theory and cryptography. II. CR capacity
- Common randomness and secret key generation with a helper
- Supermodularity and subadditivity properties of the entropy on the majorization lattice
- On a relation between information inequalities and group theory
- On characterization of entropy function via information inequalities
- Necessary and Sufficient Statistics for the Family of Shifts of Probability Distributions on Continuous BiCompact Groups
- The lattice theory of information
- On the capacity of information networks
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
