Title :
The minimal set of Ingleton inequalities
Author :
Guille, Laurent ; Chan, Terence H. ; Grant, Alex
Author_Institution :
Telecom ParisTech, Paris
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.
Keywords :
information theory; linear network analysis; linear programming; Ingleton inequalities; Shannon-type inequalities; linear network codes; linear programming; minimal set; multicast capacity region; outer bound; polyhedral cone characterization; Cramer-Rao bounds; Entropy; Linear code; Linear programming; Network coding; Network topology; Random variables; Routing; Telecommunication computing; Throughput;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595364
