The minimal set of Ingleton inequalities

Details The minimal set of Ingleton inequalities The minimal set of Ingleton inequalities

2008-02-19

arxiv.org/abs/0802.2574v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The minimal set of Ingleton inequalities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The minimal set of Ingleton inequalities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The minimal set of Ingleton inequalities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338131