The minimal set of Ingleton inequalities
Information Theory
2008-02-20 v1 math.IT
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.
Cite
@article{arxiv.0802.2574,
title = {The minimal set of Ingleton inequalities},
author = {Laurent Guille and Terence Chan and Alex Grant},
journal= {arXiv preprint arXiv:0802.2574},
year = {2008}
}