Networks, Matroids, and Non-Shannon Information Inequalities

DOI10.1109/TIT.2007.896862zbMath1323.94063OpenAlexW2167703619WikidataQ56142588 ScholiaQ56142588MaRDI QIDQ3548143

Kenneth Zeger, Randall Dougherty, Chris Freiling

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.896862

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Related Items (23)

Top-heavy phenomena for transformations ⋮ Von Staudt constructions for skew-linear and multilinear matroids ⋮ Guessing games on triangle-free graphs ⋮ The holographic entropy cone ⋮ A construction method of matroidal networks ⋮ Max-flow min-cut theorems on dispersion and entropy measures for communication networks ⋮ On the relation between the subadditivity cone and the quantum entropy cone ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Representability of matroids by \(c\)-arrangements is undecidable ⋮ Multi-variate correlation and mixtures of product measures ⋮ Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ The free product of M-fuzzifying matroids1 ⋮ Unnamed Item ⋮ Classes of matroids closed under minors and principal extensions ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Using multiobjective optimization to map the entropy region ⋮ Introduction to Secret-Sharing ⋮ On abelian and homomorphic secret sharing schemes ⋮ Matroidal error correction networks and linear network error correction MDS codes ⋮ Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction ⋮ Violations of the Ingleton inequality and revising the four-atom conjecture ⋮ Rank-Metric Codes and Their Applications

This page was built for publication: Networks, Matroids, and Non-Shannon Information Inequalities