DocumentCode
2894698
Title
Generalized cut-set bounds for networks with collocated messages
Author
Salimi, Amir ; Liu, Tie ; Cui, Shuguang
Author_Institution
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
fYear
2012
fDate
29-30 June 2012
Firstpage
114
Lastpage
118
Abstract
This paper considers classical networks with collocated multicast messages and more than three sink nodes. A new class of information-theoretic upper bounds on the achievable rates is established, generalizing the standard cut-set bounds. These new bounds involve three basic cuts of the network and are established only via the submodularity of the entropy function.
Keywords
entropy codes; network coding; collocated multicast messages; entropy function; generalized cut-set bounds; information-theoretic upper bounds; network coding problem; sink nodes; Educational institutions; Entropy; Joining processes; Network coding; Receivers; Standards; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Coding (NetCod), 2012 International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
978-1-4673-1890-7
Type
conf
DOI
10.1109/NETCOD.2012.6261894
Filename
6261894
Link To Document