## Graph Guessing Games and Non-Shannon Information Inequalities

- Rahil Baber, Demetres Christofides, Anh Nguyet Dang, Emil R. Vaughan, Søren Riis
- IEEE Transactions on Information Theory
- 2017

@article{Chan2007CapacityRF, title={Capacity regions for linear and abelian network codes}, author={T. Chan}, journal={2007 Information Theory and Applications Workshop}, year={2007}, pages={73-78} }

- Published 2007 in 2007 Information Theory and Applications Workshop

While linear network codes are proved suboptimal in general multicast scenarios, the loss of throughput due to the use of linear network codes is still unknown. This paper attempts to investigate the loss in throughput by identifying the capacity regions for linear network codes. We prove that the capacity region can be identified by taking intersection of a set of hyperplanes induced by the network and the convex cone closure of the set of all linear representable entropy functions. We also… CONTINUE READING

Highly Cited

This paper has 28 citations. REVIEW CITATIONS