On a connection between information and group lattices
DOI10.3390/E13030683zbMATH Open1229.94027OpenAlexW1972057797MaRDI QIDQ657554FDOQ657554
Authors: Hua Li, Edwin K. P. Chong
Publication date: 9 January 2012
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e13030683
Recommendations
entropyisomorphismcommon informationsubgroup latticeinformation inequalityinformation elementinformation latticeinformation lawjoint information
Information theory (general) (94A15) Measures of information, entropy (94A17) Modular lattices, complemented lattices (06C99)
Cites Work
- A Mathematical Theory of Communication
- Stochastic calculus for finance. I: The binomial asset pricing model.
- The Shannon information of filtrations and the additional logarithmic utility of insiders
- Title not available (Why is that?)
- On characterization of entropy function via information inequalities
- On a relation between information inequalities and group theory
- Common randomness in information theory and cryptography. I. Secret sharing
- Necessary and Sufficient Statistics for the Family of Shifts of Probability Distributions on Continuous BiCompact Groups
- Entropy and convergence on compact groups
- Polymatroidal dependence structure of a set of random variables
- Inequalities for Shannon entropy and Kolmogorov complexity
- On Sequences of Pairs of Dependent Random Variables
- Stochastic models, information theory, and Lie groups. Volume I: Classical results and geometric methods
- Multiple access channels with arbitrarily correlated sources
- Title not available (Why is that?)
- Every finite lattice can be embedded in a finite partition lattice
- Information-theoretic inequalities on unimodular Lie groups
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
- On a new non-Shannon type information inequality
- Piecewise linear conditional information inequality
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- On Capacity of Line Networks
- Title not available (Why is that?)
- 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
- The lattice theory of information
- On the capacity of information networks
- Recent progresses in characterising information inequalities
- Maximum entropy on compact groups
Cited In (6)
- On group-characterizability of homomorphic secret sharing schemes
- Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$
- Information-theoretic inequalities on unimodular Lie groups
- On a relation between information inequalities and group theory
- Title not available (Why is that?)
- Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer
Uses Software
This page was built for publication: On a connection between information and group lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657554)