Collecting coded coupons over overlapping generations

2010 IEEE International Symposium on Network Coding, NetCod 2010

Volumn , Issue , 2010, Pages 7-12

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

^a The State University of New Jersey   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE ANALYSIS; DECODING FAILURE; DESIGN PARAMETERS; DISTRIBUTION NETWORK; EXPECTED THROUGHPUT; OPTIMAL SELECTION; OTHER APPLICATIONS; PRACTICAL ALGORITHMS; RATE OF CONVERGENCE;

APPROXIMATION THEORY; DISTRIBUTED PARAMETER NETWORKS; INFORMATION THEORY; OPTIMIZATION; PEER TO PEER NETWORKS; THROUGHPUT;

COMPUTATIONAL COMPLEXITY;

EID: 77955693478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NETCOD.2010.5487677     Document Type: Conference Paper

References (11)

1. 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.
2. 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.
3. 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.
4. Y. Li, E. Soljanin, and P. Spasojević, "Collecting coded coupons over generations," accepted by Information Theory, 2010. ISIT 2010. IEEE International Symposium on, June 13-18 2010.
5. D. Niu and B. Li, "On the resilience-complexity tradeoff of network coding in dynamic P2P networks," in Quality of Service, 2007 Fifteenth IEEE International Workshop on, June 2007, pp. 38-46.
6. D. Silva, W. Zeng, and F. Kschischang, "Sparse network coding with overlapping classes," in Network Coding, Theory, and Applications, 2009. NetCod '09. Workshop on, June 2009, pp. 74-79.
7. A. Heidarzadeh and A. H. Banihashemi, "Overlapped chunked network coding," CoRR, vol. abs/0908.3234, 2009.
8. D. Newman and L. Shepp, "The double dixie cup problem," The American Mathematical Monthly, vol. 67, no. 1, pp. 58-61, Jan. 1960.
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. P. Flajolet, D. Gardy, and Lo "Birthday paradox, coupon collectors, caching algorithms and self-organizing search," Discrete Applied Mathematics, vol. 39, no. 3, pp. 207 - 229, 1992.
11. 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.