Network coding capacity region of line networks with node and edge constraints

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 2, Issue , 2007, Pages 949-958

  Yazdi, S M Sadegh Tabatabaei ^a   Savari, Scrap A ^a   Kramer, Gerhard ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

CAPACITY REGIONS; CUT-SET BOUND; EDGE CONSTRAINTS; EDGE-SETS; LINE NETWORK; OUTER BOUNDS;

NETWORK CODING;

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

References (14)

1. R. Ahlswede, N. Cai, S.-Y .R. Li, and R. W. Ye-ung, "Network information flow, " IEEE Trans. Inform. The-ory, vol. 46, pp. 1204-1216, July 2000.
2. M. Bakshi, M. Effros, W. Gu, and R. Koetter "On Network Coding of Independent and Dependent Sources in Line Net-works, " Proc. 2007 IEEE Int. Symp. Inform. Theory, (Nice, France), pp. 1096-1100, Jun. 24-29 2007.
3. A. Brandstadt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial & Applied Mathemat-ics, 1999.
4. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, 1991.
5. L. R. Ford and D. R. Fulkerson, Flows in Networks, Prince-ton: Pronceton University Press, 1962.
6. A. Frank, B. Shepherd, V. Tandon, and Z. Vegh, "Node-capacitated ring routing, " Mathematics of Operations Re-search, vol. 27, no. 2, pp. 372-383, May 2002.
7. G. Kramer and S. A. Savari, "On networks of two-way chan-nels, " in A. Ashikhmin, A. Barg, eds., DIMACS Workshop on Algebraic Coding Theory and Information Theory, (De-cember 15-18, 2003, Rutgers University, Piscataway, NJ), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 68, pp. 133-143, American Mathe-matical Society, Rhode Island, 2005.
8. G. Kramer and S. A. Savari, "Progressive separating edge set bounds on network coding rates, " Proc. 2005 IEEE Int. Symp. Inform. Theory, (Adelaide, Australia), pp. 1588-1592, Sept. 4-9 2005.
9. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates, " J. Network and Systems Management, vol. 14, no. 1, pp. 49-67, March 2006.
10. U. Niesen, C. Fragouli and D. Tuninetti "On the Capacity of Line Networks, " Submitted to IEEE Trans. Inform. Theory, 2005.
11. U. Niesen, C. Fragouli and D. Tuninetti "On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes", Proc. 43th Annual Allerton Conf. on Communica-tion, Control and Computing, (Monticello, IL), September, 2005.
12. P. Pakzad, C. Fragouli and A. Shokrollahi "Coding Schemes for Line Networks, " Proc. 2005 IEEE Int. Symp. Inform. Theory, (Adelaide, Australia), Sept. 4-9 2005.
13. S. A. Savari and G. Kramer, "The Multimessage Unicast Ca-pacity Region for Bidirectional Ring Networks, " Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, WA, My 2006.
14. R. W. Yeung S-Y. R. Li and N. Cai. "Linear network cod-ing, " IEEE Trans. Inform. Theory, vol. 49, pp. 371-381, February 2003.