About: Raptor code

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Raptor code Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRaptor_code

In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. They were invented by Amin Shokrollahi in 2000/2001 and were first published in 2004 as an extended abstract. Raptor codes are a significant theoretical and practical improvement over LT codes, which were the first practical class of fountain codes. Online codes are an example of a non-systematic fountain code.

Attributes	Values
rdfs:label	Raptor code (en)
rdfs:comment	In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. They were invented by Amin Shokrollahi in 2000/2001 and were first published in 2004 as an extended abstract. Raptor codes are a significant theoretical and practical improvement over LT codes, which were the first practical class of fountain codes. Online codes are an example of a non-systematic fountain code. (en)
dcterms:subject	Coding theory
Wikipage page ID	3340191 (xsd:integer)
Wikipage revision ID	1118208214 (xsd:integer)
Link from a Wikipage to another Wikipage	Amin Shokrollahi Dynamic Adaptive Streaming over HTTP Gaussian elimination Erasure code Computer science Tornado code Tornado codes List of ATSC standards 3rd Generation Partnership Project Coding theory Hamming code ATSC 3.0 DVB-H standard IETF Online codes LT code LT codes XOR Fountain codes Low density parity check code Mobile cellular wireless Binary Gray sequence
Link from a Wikipage to an external page	http://www.3gpp.org http://www.dvb.org http://www.dvb-h-online.org/technology.htm http://tools.ietf.org/html/rfc5053 http://tools.ietf.org/html/rfc6330 https://www.atsc.org/wp-content/uploads/2016/01/A331S33-174r6-Signaling-Delivery-Sync-FEC.pdf https://datatracker.ietf.org/ipr/search/%3Foption=rfc_search&rfc_search=5053 https://datatracker.ietf.org/ipr/search/%3Foption=rfc_search&rfc_search=6330 http://ieeexplore.ieee.org/iel5/18/34354/01638543.pdf%3Fisnumber=34354&prod=JNL&arnumber=1638543&arSt=2551&ared=2567&arAuthor=Shokrollahi%2C+A. http://www.3gpp.org/ftp/Specs/html-info/26346.htm
sameAs	Raptor code Raptor code Raptor code
dbp:wikiPageUsesTemplate	dbt:About dbt:Citation_style dbt:Reflist dbt:Format_footnotes
has abstract	In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. They were invented by Amin Shokrollahi in 2000/2001 and were first published in 2004 as an extended abstract. Raptor codes are a significant theoretical and practical improvement over LT codes, which were the first practical class of fountain codes. Raptor codes, as with fountain codes in general, encode a given source block of data consisting of a number k of equal size source symbols into a potentially limitless sequence of encoding symbols such that reception of any k or more encoding symbols allows the source block to be recovered with some non-zero probability. The probability that the source block can be recovered increases with the number of encoding symbols received above k becoming very close to 1, once the number of received encoding symbols is only very slightly larger than k. For example, with the latest generation of Raptor codes, the RaptorQ codes, the chance of decoding failure when k encoding symbols have been received is less than 1%, and the chance of decoding failure when k+2 encoding symbols have been received is less than one in a million. (See Recovery probability and overhead section below for more discussion on this.) A symbol can be any size, from a single byte to hundreds or thousands of bytes. Raptor codes may be systematic or non-systematic. In the systematic case, the symbols of the original source block, i.e. the source symbols, are included within the set of encoding symbols. Some examples of a systematic Raptor code is the use by the 3rd Generation Partnership Project in mobile cellular wireless broadcasting and multicasting, and also by DVB-H standards for IP datacast to handheld devices (see external links). The Raptor codes used in these standards is also defined in IETF RFC 5053. Online codes are an example of a non-systematic fountain code. (en)
gold:hypernym	Class
prov:wasDerivedFrom	wikipedia-en:Raptor_code?oldid=1118208214&ns=0
page length (characters) of wiki page	9587 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Raptor_code
is Link from a Wikipage to another Wikipage of	Amin Shokrollahi Error correction code École Polytechnique Fédérale de Lausanne Tornado code Fountain code Luby transform code Raptor Raptor codes
is Wikipage redirect of	Raptor codes
is Wikipage disambiguates of	Raptor
is foaf:primaryTopic of	wikipedia-en:Raptor_code

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software