Entropy vectors and network codes
Information Theory
2007-07-13 v1 Networking and Internet Architecture
math.IT
Abstract
We consider a network multicast example that relates the solvability of the multicast problem with the existence of an entropy function. As a result, we provide an alternative approach to the proving of the insufficiency of linear (and abelian) network codes and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.
Keywords
Cite
@article{arxiv.cs/0702063,
title = {Entropy vectors and network codes},
author = {Terence Chan and Alex Grant},
journal= {arXiv preprint arXiv:cs/0702063},
year = {2007}
}