Collecting coded coupons over generations

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 2448-2452

  Li, Yao ^a   Soljanin, Emina ^b   Spasojević, Predrag ^a  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODED PACKET; CONTENT DISTRIBUTION; DECODING FAILURE; LINK CAPACITIES; NEW RESULTS;

DECODING; INFORMATION THEORY; THROUGHPUT;

COMPUTATIONAL COMPLEXITY;

EID: 77955669279     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513757     Document Type: Conference Paper

References (18)

1. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. New York: John Wiley & Sons Inc., 1968, vol. 1, pp. 224-225.
2. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4, March 2005, pp. 2235-2245 vol. 4.
3. C. Fragouli and E. Soljanin, Network Coding Applications. now Publishers Inc., 2007, vol. 2, no. 2, pp. 146-147.
4. G. Ma, Y. Xu, M. Lin, and Y. Xuan, "A content distribution system based on sparse linear network coding," in Network Coding, Theory, and Applications, 2007. NetCod '07. Workshop on, January 2007, pp. 1-6.
5. M. Luby, "LT codes," in Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 271-280.
6. A. Shokrollahi, "Raptor codes," Information Theory, IEEE Transactions on, vol. 52, no. 6, pp. 2551-2567, June 2006.
7. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2003.
8. P. Maymounkov, N. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. 44th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sept. 2006.
9. D. Foata and D. Zeilberger, "The collector's brotherhood problem using the Newman-Shepp symbolic method," Algebra Universalis, vol. 49, no. 4, pp. 387-395, 2003.
10. A. Boneh and M. Hofri, "The coupon-collector problem revisited a survey of engineering problems and computational methods," Stochastic Models, vol. 13, pp. 39 - 66, 1997. [Online]. Available: http://www. informaworld.com/10.1080/15326349708807412
11. M. H. Gail, G. H. Weiss, N. Mantel, and S. J. O'Brien, "A solution to the generalized birthday problem with application to allozyme screening for cell culture contamination," Journal of Applied Probability, vol. 16, pp. 242-251, 1979.
12. S. Savage, D. Wetherall, A. Karlin, and T. Anderson, "Network support for ip traceback," IEEE/ACM Trans. Netw., vol. 9, no. 3, pp. 226-237, 2001.
13. D. Newman and L. Shepp, "The double dixie cup problem," The American Mathematical Monthly, vol. 67, no. 1, pp. 58-61, Jan. 1960.
14. L. Flatto, "Limit theorems for some random variables associated with urn models," The Annals of Probability, vol. 10, no. 4, pp. 927-934, 1982. [Online]. Available: http://www.jstor.org/stable/2243548
15. A. N. Myers and H. S. Wilf, "Some new aspects of the coupon collector's problem," SIAM Rev., vol. 48, no. 3, pp. 549-565, 2006.
16. P. Erdös and A. Rényi, "On a classical problem of probability theory," Magyar Tud. Akad. Mat. Kutató Int. Közl., vol. 6, pp. 215-220, 1961.
17. Y. Li, E. Soljanin, and P. Spasojević, "Collecting coded coupons over overlapping generations," accepted by IEEE International Symposium on Network Coding(NetCod) 2010, Toronto, Canada, June 9-11 2010.
18. -, "Collecting coded coupons over generations," submitted to IEEE Transactions on Information Theory, 2010.