The Minimal Set of Ingleton Inequalities

DOI10.1109/TIT.2011.2111890MaRDI QIDQ5280953zbMATH OpenOpenAlexFDO

Authors Laurent Guillé, Terence H. Chan, Alex Grant

Publication date 27 July 2017

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

Full work available at URL https://arxiv.org/abs/0802.2574

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Abstract: The Ingleton-LP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obtained by taking the intersection of half-spaces induced by the basic (Shannon-type) inequalities and Ingleton inequalities. This paper simplifies the characterization of this cone, by obtaining the unique minimal set of Ingleton inequalities. As a result, the effort required for computation of the Ingleton-LP bound can be greatly reduced.

Cited in

(3)

• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• On ideal and weakly-ideal access structures
• New inequalities for subspace arrangements

This page was built for publication: The Minimal Set of Ingleton Inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280953)