Network coding with unequal size overlapping generations

2012 International Symposium on Network Coding, NetCod 2012

Volumn , Issue , 2012, Pages 161-166

  Li, Ye ^a   Chan, Wai Yip ^a   Blostein, Steven D ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPLEX NETWORKS;

AND-OR TREE; BACK SUBSTITUTIONS; CONTENT DISTRIBUTION; DEGREE DISTRIBUTIONS; LARGE NETWORKS; NETWORK TOPOLOGY; NO FEEDBACKS; TRANSMISSION OVERHEADS;

NETWORK CODING;

EID: 84866706050     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/netcod.2012.6261902     Document Type: Conference Paper

References (14)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413-4430, 2006. (Pubitemid 46445282)
3. M. L. G. Ma, Y. Yu and Y. Xuan, "A content distribution system based on sparse linear network coding," in Proc. NetCod'07, 2007.
4. J. Blomer, R. Karp, and E. Welzl, "The rank of sparse random matrices over finite fields," Random Structures and Algorithms, vol. 10, no. 4, pp. 407-419, 1997. (Pubitemid 127342404)
5. X. Li, W. H. Mow, and F.-L. Tsang, "Rank distribution analysis for sparse random linear network coding," in Proc. Int Network Coding (NetCod) Symp, 2011, pp. 1-6.
6. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. of Allerton Conference on Communication, Control, and Computing, Oct. 2003.
7. P. Maymounkov, N. J. A. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. of Allerton Conference on Communication, Control, and Computing, Sep. 2006, pp. 482-491.
8. D. Silva, W. Zeng, and F. R. Kschischang, "Sparse network coding with overlapping classes," in Proc. Workshop Network Coding, Theory, and Applications NetCod '09, 2009, pp. 74-79.
9. D. J. C. MacKay, "Fountain codes," IEE ProceedingsCommunications, vol. 152, no. 6, pp. 1062-1068, 2005.
10. A. Heidarzadeh and A. H. Banihashemi, "Overlapped chunked network coding," in Proc. IEEE Information Theory Workshop (ITW), 2010, pp. 1-5.
11. Y. Li, E. Soljanin, and P. Spasojevic, "Effects of the generation size and overlap on throughput and complexity in randomized linear network coding," IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 1111-1123, 2011.
12. S. Yang and R. W. Yeung, "Coding for a network coded fountain," in Proc. (ISIT) Symp. IEEE Int Information Theory, 2011, pp. 2647-2651.
13. M. Luby, M. Mitzenmacher, and A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, January 1998, pp. 364-373.
14. A. Shokrollahi, "Raptor codes," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551-2567, 2006.