Entropy of Closure Operators and Network Coding Solvability
The entropy of a closure operator has been recently proposed for the study of network coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank functions for a given closure operator, which determine bounds on t...
Main Author: | Maximilien Gadouleau |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2014-09-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/16/9/5122 |
Similar Items
-
Linear Programming Problems in Network Coding and Closure Operators via Partitions
by: Victor Peña-Macias, et al.
Published: (2019-12-01) -
Entropy, Closures and Subgrid Modeling
by: Terence J. O’Kane, et al.
Published: (2008-11-01) -
Some New Reverses and Refinements of Inequalities for Relative Operator Entropy
by: Sever Dragomir
Published: (2018-12-01) -
Functional version for Furuta parametric relative operator entropy
by: Mustapha Raïssouli, et al.
Published: (2018-08-01) -
Symmetrical Multilevel Diversity Coding and Subset Entropy Inequalities
by: Jiang, Jinjing
Published: (2013)