Generalized cut-set bounds for networks with collocated messages Conference Paper

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. 2012 IEEE.

authors

• Liu, Tie

published proceedings

• 2012 International Symposium on Network Coding, NetCod 2012

author list (cited authors)

• Salimi, A., Liu, T., & Cui, S.

complete list of authors

• Salimi, A||Liu, T||Cui, S

publication date

• October 2012

International Standard Book Number (ISBN) 13

• 9781467318921

start page

• 114

end page

• 118