Raptor codes

LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor code...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 52; H. 6; S. 2551 - 2567
1. Verfasser: Shokrollahi, A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Binary erasure channel (BEC)
Buffer overflow
Codes
Coding
Computer networks
Decoders
Decoding
Error analysis
Error probability
Fault tolerance
graphical codes
Internet
Large-scale systems
LT-codes
Mathematical analysis
networking
Probability
Protocols
Scalability
Streams
Studies
Symbols
ISSN:0018-9448, 1063-6692, 1557-9654, 1558-2566
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real epsiv>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1+epsiv) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/epsiv)) operations, and the original symbols are recovered from the collected ones with O(klog(1/epsiv)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions in which the first output elements of the coding system coincide with the original k elements
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Feature-1
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1063-6692
1557-9654
1558-2566
DOI:10.1109/TIT.2006.874390