Windowed erasure codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 509-513

  Studholme, Chris ^a   Blake, Ian ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ERASURE CODES; INFORMATION SYMBOLS;

ALGORITHMS; RANDOM PROCESSES;

CODES (SYMBOLS);

EID: 39049121739     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261768     Document Type: Conference Paper

References (10)

1. Johannes Blömer, Richard Karp, and Emo Welzl, The rank of sparse random matrices over finite fields, Random Structures and algorithms 10 (1997), 407-419.
2. R. Brent, S. Gao, and A. Lauder, Random Krylov spaces over finite fields, SIAM J. Dicsrete Math. 16 (2003), 276-287.
3. Colin Cooper, On the distribution of rank of a random matrix over a finite field, Random Structures and Algorithms 17 (2000), 197-212.
4. _ , On the rank of random matrices, Random Structures and Algorithms 16 (2000), no. 2, 209-232.
5. R.G. Gallager, Low density parity check codes, MIT Press (1963).
6. V.F. Kolchin, Random graphs, Cambridge University Press (1999).
7. Michael Luby, LT codes, In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.
8. Michael Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel Speilman, and Volker Stemann, Practical loss-resilient codes, STOC (1997), 150-159.
9. Petar Maymounkov, Online codes, 2002, Technical Report TR2002-833, New York University, October 2002.
10. Amin Shokrollahi, Raptor codes, 2003, Available at: http://www.inference.phy.cam.ac.uk/mackay/DFountain.html.