Network coding capacity with a constrained number of coding nodes

IEEE Transactions on Information Theory

Volumn 54, Issue 3, 2008, Pages 1287-1291

  Cannons, Jillian ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Capacity; Flow; Information theory; Network coding; Throughput

Indexed keywords

CONSTRAINT THEORY; ROUTERS; SIGNAL ENCODING; THROUGHPUT;

CODING NODES; NETWORK CODING;

CHANNEL CAPACITY;

EID: 40949165784     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.915719     Document Type: Article

References (13)

1. R. Ahldswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan, "Minimal network coding for multicast," in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT), Adelaide, Australia, Sep. 2005.
3. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006.
4. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
5. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2365-2372, Jun. 2006, Joint issue with IEEE/ACM Trans. Netw.
6. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006.
7. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2386-2397, Jun. 2006, Joint issue with IEEE/ACM Trans. Netw.
8. Z. Li and B. Li, "Network coding: The case of multiple unicast sessions," in Proc. 42nd Ann. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2004.
9. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
10. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), San Diego, CA, Jun. 2003, pp. 286-294.
11. A. Tavory, M. Feder, and D. Ron, "Bounds on linear codes for network multicast," Proc. Electronic Colloquium on Computational Complexity (ECCC), pp. 1-28, 2003.
12. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of network coding and tree packing (routing) theorems," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2398-2409, Jun. 2006, Joint issue with IEEE/ACM Trans. Netw.
13. R. W. Yeung, A First Course in Information Theory. Amsterdam, The Netherlands: Kluwer, 2002.