Average throughput with linear network coding over the binary field

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 90-95

  Al Bashabshch, Ali ^a   Yongacoglu, Abbas ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CYBERNETICS; EIGENVALUES AND EIGENFUNCTIONS; INFORMATION THEORY; PROGRAMMING THEORY;

(E ,2E) THEORY; AVERAGE THROUGHPUT; BINARY FIELDS; LINEAR CODING; MULTICAST NETWORKS; NETWORK CODING; NUMBER OF NODES;

THROUGHPUT;

EID: 46749130949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313055     Document Type: Conference Paper

References (13)

1. R. Ahlswede, N. Cai, S.-Y. Li, and R. W. Yeung, "Network information flow," IEEE Trans. on Info. Theory., vol. 46, no. 4, pp. 1204-1216, July 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai. "Linear network coding." IEEE Trans. on Info. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. P. Sanders, S. Egner, and L. Tolhuizen. "Polyniomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms and Architectures, San Diego, CA, June 2003, pp. 286-294.
4. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA). New Orleans, LA, Jan. 2004, pp. 142-150.
5. A. Rasala-Lehman, "Network coding," Ph.D. dissertation. Department of Electrical Eng. and Computer Science, MIT, Cambridge, MA, 2005.
6. C. Chekuri, C. Fragouli, and H. Soljanin., "On average throughput and alphabet size in network coding," IEEE Trans. on Info. Theory, vol. 52, No. 6, pp. 2410-2424, June, 2006.
7. R. Dougherthy. C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. on Info. Th., vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
8. Y. Cassuto and J. Bruck, "Network coding for non-uniform demands," in ISIT 2005, Adelaide, Australia, Sept. 2005.
9. R. Dougherthy, C. Freiling, and K. Zeger, "Linearity and solvability in multicast networks," IEEE Trans. on Info. Th., vol. 50, no. 10. pp. 2243-2256, Oct. 2004.
10. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. on Info. Theory, vol. 52, no. 3, pp. 829-848, March 2006.
11. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. on Info. Theory, vol. 52, no. 3, pp. 777-788, March 2006.
12. A. Ali, J. Hirschfeld, and H. Kaneta, "On the sire of arcs in projective spaces," IEEE Trans. on Info Theory, vol. 41, no. 5, pp. 1649-1656, Sept. 1995.
13. A. Agarwal and M. Charikar, "On the advantage of networrk coding for improving network throughput," in Proc. 2004 IEEE Information Theory Workshop, San Antonio, Texas, Oct. 2004, pp. 247-249.