DocumentCode
2026935
Title
Entropy Vectors and Network Codes
Author
Chan, T. ; Grant, A.
Author_Institution
Inst. for Telecommun. Res., Univ. of South Australia, Adelaide, SA
fYear
2007
fDate
24-29 June 2007
Firstpage
1586
Lastpage
1590
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
directed graphs; entropy codes; linear codes; multicast communication; directed acyclic graph; entropy vectors; linear codes; network codes; network coding capacity; network multicast; nonShannon inequalities; Australia; Bandwidth; Communication networks; Computer science; Costs; Entropy; Network coding; Random variables; Robustness; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557448
Filename
4557448
Link To Document