DocumentCode
3185928
Title
Dualities between Entropy Functions and Network Codes
Author
Chan, Terence ; Grant, Alex
Author_Institution
Univ. of South Australia, Adelaide
fYear
2008
fDate
3-4 Jan. 2008
Firstpage
1
Lastpage
6
Abstract
This paper provides new dualities between entropy functions and network codes. These duality results give an alternative proof 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
codes; duality (mathematics); abelian codes; duality results; entropy functions; network codes; nonShannon inequalities; Australia; Communication networks; Cramer-Rao bounds; Entropy; Linear programming; Network coding; Random variables; Telecommunications; Throughput; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Coding, Theory and Applications, 2008. NetCod 2008. Fourth Workshop on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-1689-9
Type
conf
DOI
10.1109/NETCOD.2008.4476178
Filename
4476178
Link To Document