Relaying a fountain code across multiple nodes

2008 IEEE Information Theory Workshop, ITW

Volumn , Issue , 2008, Pages 149-153

  Gummadi, Ramakrishna ^a   Sreenivas, R S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; CODES (STANDARDS); CYBERNETICS; FOUNTAINS; INFORMATION THEORY; PROGRAMMING THEORY; THROUGHPUT;

BLOCK LENGTHS; CODING COMPLEXITIES; CODING SCHEMES; ERASURE CHANNELS; FOUNTAIN CODES; INTERMEDIATE NODES; LINE NETWORKS; LOW-COMPLEXITY; LT CODES; MIN-CUT; MULTIPLE NODES; ON-THE-FLY; OPTIMALITY; PACKET LEVELS; PER-SYMBOL; RANDOM LINEAR CODES; RECODING; SINGLE SOURCING;

CODES (SYMBOLS);

EID: 51849086816     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2008.4578640     Document Type: Conference Paper

References (6)

1. M.Luby, "LT Codes", Proc. FOCS 2002.
2. A. Shokrollahi, "Raptor Codes", IEEE Transactions on Information Theory, vol. 52, num. 6 (2006), p. 2551-2567 2006
3. R. Darling, J. R. Norris, "Structure of large random hypergraphs", Annals of Applied Probability 2005, Vol. 15, No. 1A, 125-152.
4. Nicholas Harvey, Desmond Lun and Petar Maymounkov, "Methods for Efficient Network Coding", Proc. Allerton 2006.
5. D. S. Lun, M. Medard, and M. Effros, "On coding for reliable communication over packet networks", Proc. Allerton 2004.
6. P. Pakzad, C. Fragouli and A. Shokrollahi, "Coding schemes for line networks", Proc. ISIT 2005.