Title :
Cut sets and information flow in networks of two-way channels
Author :
Kramer, Gerhard ; Savari, Serap A.
Author_Institution :
Math. of Commun. Res. Dept., Lucent Technol. Bell Labs., Murray Hill, NJ, USA
fDate :
27 June-2 July 2004
Abstract :
A network of two way channels (TWCs) is specified by a graph having an edge between vertex u and vertex v if there is a TWC between these vertices. A new cut-set bound is determined for such networks when network coding is permitted, and some implications of this bound are discussed.
Keywords :
channel capacity; channel coding; directed graphs; linear codes; optimisation; bidirected cut-set bound; directed graph; linear network coding; network information flow; two-way channels; Communication networks; Computer science; Electronic mail; Intelligent networks; Mathematics; Network coding; Routing; Transportation;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365070
