Raptor packets: A packet-centric approach to distributed raptor code design

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2336-2340

  Vukobratović, Dejan ^a   Stefanović, Čedomir ^a   Stojaković, Miloš ^a   Stanković, Vladimir ^b  

^a UNIVERSITY OF NOVI SAD   (Serbia)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEME; DEGREE DISTRIBUTIONS; INFORMATION PACKETS; NETWORK NODE; PACKET-CENTRIC; PRECODING; RANDOM NETWORK; RAPTOR CODES; SIMULATION RESULT;

INFORMATION THEORY;

ENCODING (SYMBOLS);

EID: 70449514952     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205950     Document Type: Conference Paper

References (14)

1. M. Luby, "LT Codes,' Proc. ofthe 43rd Annual IEEE Symp . Foundations of Computer Science (FOCS),Vancouver, Canada, November 2002.
2. A. Shokrollahi, "Raptor Codes," IEEE Trans. on Information Theory,vol. 52, No.6, pp. 2551-2567, June 2006.
3. A. Dimakis, V. Prabhakaran, K. Ramchandran, "Distributed Fountain Codes for Networked Storage," Proc. IEEE ICASSP 2006, 2006.
4. A. Kamra, 1. Feldman, V. Misra and D. Rubenstein, "Growth Codes: Maximizing Sensor Network Data Persistence," Proc. ACM SIGCOMM 2006,Pisa, Italy, 2006.
5. Y. Lin, B. Liang and B. Li, "Data Persistanee in Large-Scale Sensor Networks with Decentralized Fountain Codes," Proc. IEEE INFOCOM 2007,Anchorage, AL, USA, 2007.
6. S. Aly, Z. Kong, and E. Soljanin, "Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks," Proc. IEEE/ACM IPSN 2008,S. Louis, MO, USA, 2008.
7. S. Aly, Z. Kong, and E. Soljanin, "Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks," Proc. IEEE ISIT 2008,Toronto, Canada, 2008.
8. H. Jin, A. Khandekar and R. McEliece, "Irregular Repeat-Accumulate Codes,"Proc. of Turbo-Coding Symposium, Brest, France, 2000.
9. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equations of state calculations by fast computing machines," J. Chem. Phys.,vol. 21, pp. 1087-1092, 1953.
10. S. Boyd, P. Diaconis, and L. Xiao, "Fastest Mixing Markov Chain on a Graph," SIAM Review, problems and techn iques section,vol. 46(4), pp. 67--689, December 2004.
11. L. Lovasz, Random walks on graphs: A survey, in: Combinatorics, Paul Erdosis Eighty,Vol. 2, Keszthely, 1993, in: Bolyai Soc. Math. Stud., vol. 2, Janos Bolyai Math. Soc., Budapest, 1993, pp. 1--46.
12. D. Aldous, J. Fill, "Reversible Markov chains and random walks on graphs," unpublished, http://stat-www.berkeley.edulusers/aldousIRWG/ book.html, 2008.
13. S. Datta and II. Kargupta, "Uniform Data Sampling from a Peer-to-Peer Network," Proc. IEEE ICDCS 2007,Toronto, Canada, June 2007.
14. J. Garcia-Frias and W. Zhong, "Approaching Shannon Performance by Iterative Decoding of Linear Codes with Low-Density Generator Matrix," IEEE Comm. Letters,vol. 7, No.6, pp. 266--268, June 2003.