The minimal set of Ingleton inequalities

Simple item page
dc.creatorGuille, Laurent
dc.creatorChan, Terence
dc.creatorGrant, Alex
dc.date2008-02-19
dc.date.accessioned2026-07-07T09:21:41Z
dc.date.available2026-07-07T09:21:41Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0802.2574
dc.identifierhttp://arxiv.org/abs/0802.2574
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155111
dc.subjectInformation Theory
dc.titleThe minimal set of Ingleton inequalities
dc.typetext

Files

Collections

arXiv