Infoscience

Conference paper

Raptor codes

Shokrollahi, Amin
  • Published in: Proceedings of the IEEE International Symposium on Information Theory, ISIT 2004, p. 36
  • : , 2004

This paper exhibits a class of universal Raptor codes: for a given integer k, and any real /spl epsiv/>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + /spl epsiv/) is sufficient to recover the original k symbols, with high probability. Each output symbol is generated using O(log(1//spl epsiv/)) operations, and the original symbols are recovered from the collected ones with O(klog(1//spl epsiv/)) operations.

Keywords: algoweb_fountain

Reference

Record created on 2007-01-16, modified on 2012-03-20

Fulltext

Contacts

EPFL authors