Progressive d-separating edge set bounds on network coding rates

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1588-1592

  Kramer, Gerhard ^a   Savari, Scrap A ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUT-SET BOUND; EDGE-CUT BOUND; NETWORK GRAPH; ROUTING RATES;

GRAPH THEORY; INFORMATION TECHNOLOGY; INFORMATION THEORY; ROUTERS; SIGNAL ENCODING;

TELECOMMUNICATION NETWORKS;

EID: 33749437065     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523612     Document Type: Conference Paper

References (15)

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. G. Kramer and S. A. Savari, "On networks of two-way channels," to appear in the Proc. DIMACS Workshop on Algebraic Coding Theory and Information Theory, DIMACS Center, Rutgers University, Dec. 15-18, 2003.
4. L. R. Ford and D. R. Fulkerson, Flows in Networks , Princeton: Princeton University Press, 1962.
5. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, Calif., 1988.
6. G. Kramer, Directed Information for Channels with Feedback, Hartung-Gorre Verlag, Konstanz, 1998, ETH Series in Information Processing, Vol. 11.
7. S. P. Borade, "Network information flow: limits and achievability," Proc. IEEE Int. Symp. Inform. Theory, Lausanne, Switzerland, p. 139, June 30-July 5, 2002.
8. A. Schrijver, Combinatorial Optimization, New York: Springer, 2003.
9. G. Kramer, "Capacity results for the discrete memoryless network," IEEE Trans. Inform. Theory, vol. 49, no. 1 , pp. 4-21, Jan. 2003.
10. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Network and Systems Management, submitted April 2005.
11. T. C. Hu, "Multi-commodity network flows," Oper. Res., vol. 11, pp. 344-360, 1963.
12. H. Okamura and P. D. Seymour, "Multicommodity flows in planar graphs," J. Combin. Theory, Series B 31, pp. 75-81, 1981.
13. DIMACS Working Group on Network Coding, DIMACS Center, Rutgers University, Piscataway, NJ, Jan. 26-28, 2005 (URL: http://dimacs.rutgers.edu/ Workshops/NetworkCodingWG).
14. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE Trans. Inform. Theory, submitted March 2005.
15. K. Jain, P. A. Chou, V. V. Vazirani, R. Yeung, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," IEEE Trans. Inform. Theory, submitted March 2005.