Cut sets and information flow in networks of two-way channels
- 23 December 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A network of two way channels (TWCs) is specifled by a graph having an edge between ver- tex 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
This publication has 2 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Network information flowIEEE Transactions on Information Theory, 2000