Raptor codes

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.


Published in:
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2004, 36
Year:
2004
Keywords:
Laboratories:




 Record created 2007-01-16, last modified 2018-07-07


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)