Entropy of Closure Operators and Network Coding Solvability
AbstractThe 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 the entropy of that operator. This yields new axioms for matroids based on their closure operators. We also determine necessary conditions for a large class of closure operators to be solvable. We then define the Shannon entropy of a closure operator and use it to prove that the set of closure entropies is dense. Finally, we justify why we focus on the solvability of closure operators only. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Gadouleau, M. Entropy of Closure Operators and Network Coding Solvability. Entropy 2014, 16, 5122-5143.
Gadouleau M. Entropy of Closure Operators and Network Coding Solvability. Entropy. 2014; 16(9):5122-5143.Chicago/Turabian Style
Gadouleau, Maximilien. 2014. "Entropy of Closure Operators and Network Coding Solvability." Entropy 16, no. 9: 5122-5143.