Distributed unequal error protection rateless codes over erasure channels: A two-source scenario

IEEE Transactions on Communications

Volumn 60, Issue 8, 2012, Pages 2084-2090

  Talari, Ali ^a   Rahnavard, Nazanin ^a  

^a Oklahoma State University   (United States)

Author keywords

Distributed rateless codes; erasure channels; genetic algorithms optimization; unequal error protection

Indexed keywords

ANALYSIS TECHNIQUES; CODING PARAMETERS; ERASURE CHANNELS; GENETIC ALGORITHMS OPTIMIZATIONS; MULTI-OBJECTIVE GENETIC ALGORITHM; RATELESS CODES; RATELESS CODING; UNEQUAL ERROR PROTECTIONS;

GENETIC ALGORITHMS;

DESIGN;

EID: 84885853537     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2012.051512.110109     Document Type: Article

References (15)

1. M. Luby, "LT codes," in Proc. 2002 Annual IEEE Symp. Foundations Comput. Science, pp. 271-280.
2. S. Puducheri, J. Kliewer, and T. Fuja, "The design and performance of distributed LT codes," IEEE Trans. Inf. Theory, vol. 53, pp. 3740-3754, Oct. 2007.
3. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evolutionary Comput., vol. 6, pp. 182-197, Apr. 2002.
4. A. Talari and N. Rahnavard, "Distributed rateless codes with UEP property," in Proc. 2010 IEEE International Symp. Inf. Theory Proc., pp. 2453-2457.
5. D. Sejdinovic, R. Piechocki, and A. Doufexi, "AND-OR tree analysis of distributed LT codes," in Proc. 2009 IEEE Inf. Theory Workshop Netw. Inf. Theory, pp. 261-265.
6. A. Liau, S. Yousefi, and I. Kim, "Binary soliton-like rateless coding for the y-network," IEEE Trans. Commun., vol. PP, no. 99, pp. 1-6, 2011.
7. R. Gummadi and R. Sreenivas, "Relaying a fountain code across multiple nodes," in Proc. 2008 IEEE Inf. Theory Workshop, pp. 149-153.
8. N. Rahnavard, B. Vellambi, and F. Fekri, "Rateless codes with unequal error protection property," IEEE Trans. Inf. Theory, vol. 53, pp. 1521-1532, Apr. 2007.
9. N. Rahnavard and F. Fekri, "Generalization of rateless codes for unequal error protection and recovery time: asymptotic analysis," in Proc. 2006 IEEE International Symp. Inf. Theory, pp. 523-527.
10. M. Luby, M. Mitzenmacher, and M. Shokrollahi, "Analysis of random processes via And-Or tree evaluation," in Proc. 1998 ACM-SIAM Symp. Discrete Algorithms, pp. 364-373.
11. P. Maymounkov, "Online codes," NYU Tech. Rep. TR2003-883, 2002.
12. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 1997 Annual ACM Symp. Theory Comput., pp. 150-159.
13. N. Rahnavard and F. Fekri, "Finite-length unequal error protection rateless codes: design and analysis," in Proc. 2005 IEEE Global Telecommun. Conf., vol. 3, p. 5.
14. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, pp. 2551-2567, June 2006.
15. Available: http://cwnlab.ece.okstate.edu/.