Cut sets and information flow in networks of two-way channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 33-

  Kramer, Gerhard ^a   Savari, Serap A ^a,b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY BOUNDARY POINTS; CUT-SET BOUND; NETWORK EDGE; TWO-WAY CHANNELS;

CARRIER COMMUNICATION; CHANNEL CAPACITY; COMMUNICATION SYSTEMS; DATA PROCESSING; GRAPH THEORY; OPTIMIZATION; ROUTERS; SIGNAL ENCODING;

COMPUTER NETWORKS;

EID: 5044243545     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, pp. 1204-1216, July 2000.
2. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, 1991.
3. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, 2003.
4. G. Kramer and S. A. Savari, "On networks of two-way channels," DIMACS Workshop on Algebraic Coding Theory and Information Theory, (Rutgers University, Piscataway, NJ, USA), Dec. 15-18, 2003.
5. A. Schrijver, Combinatorial Optimization, New York: Springer, 2003.