Raptor 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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 11675
Domain group: Formal Sciences
Origin domain: Information Theory
Subdomains: Coding Theory, Fountain Codes → Information Theory

Core Idea¶

Raptor code is treated here as the recurring coding theory identity summarized by this source-grounded definition: In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding.

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.

For Raptor code, the abstraction is narrower than the article's general subject matter: a positive case must preserve In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in coding theory, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver.
Constitutive relation — Raptor codes are formed by the concatenation of two codes.
Operating condition — This pre-code may itself be a concatenation of multiple codes, for example in the code standardized by 3GPP a high density parity check code derived from the binary Gray sequence is concatenated with a simple regular low density parity check code.
Recognition evidence — In the case of systematic Raptor codes, the input to the pre-coding stage is obtained by first applying the inverse of the encoding operation that generates the first k output symbols to the source data.
Admissible variation — Thus, applying the normal encoding operation to the resulting symbols causes the original source symbols to be regenerated as the first k output symbols of the code.
Characteristic consequence — processes which generate the first k output symbols generate an operation which is invertible.
Failure boundary — In a combined approach, the relationships between symbols defined by both the inner and outer codes are considered as a single combined set of simultaneous equations which can be solved by the usual means, typically by Gaussian elimination.

What It Is Not¶

Not the whole field of coding theory. The node requires the specific identity stated by In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding.
Not an over-broad reading. (Based on elementary information theory considerations, complete recovery of a source block with k source symbols is not possible if less than k encoding symbols are received.).
Not an over-broad reading. The most advanced version of Raptor is the RaptorQ code defined in IETF .
Not an over-broad reading. The RaptorQ code is a systematic code, can be implemented in a way to achieve linear time encoding and decoding performance, has near-optimal recovery properties, supports up to 56,403 source symbols, and can support an essentially unlimited number of encoding symbols.
Not automatically Tornado Code. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Raptor code applies literally inside coding theory wherever the source-defined carrier and relation can be established. Its documented habitats include:

Overview. In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver.
Overview. In the case of non-systematic Raptor codes, the source data to be encoded is used as the input to the pre-coding stage.
Decoding. In a concatenated approach, the inner code is decoded first, using a belief propagation algorithm, as used for the LT codes.
Documented setting. The Raptor codes used in these standards is also defined in IETF .
Documented setting. 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.
RaptorQ code. The most advanced version of Raptor is the RaptorQ code defined in IETF .

Outside coding theory, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Classification or should be marked as analogy.

Clarity¶

A clear use of Raptor code names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. The strongest recognition evidence in the frozen account is: In the case of systematic Raptor codes, the input to the pre-coding stage is obtained by first applying the inverse of the encoding operation that generates the first k output symbols to the source data. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification (Based on elementary information theory considerations, complete recovery of a source block with k source symbols is not possible if less than k encoding symbols are received.). so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Raptor code compresses multiple coding theory details into a stable diagnostic relation. The source shows both the central mechanism—raptor codes are formed by the concatenation of two codes.—and the practical consequence—processes which generate the first k output symbols generate an operation which is invertible. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the coding theory entities to which the claim applies.
State the relation. Use the source-grounded identity: In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding.
Check operation and conditions. This pre-code may itself be a concatenation of multiple codes, for example in the code standardized by 3GPP a high density parity check code derived from the binary Gray sequence is concatenated with a simple regular low density parity check code.
Demand recognition evidence. In the case of systematic Raptor codes, the input to the pre-coding stage is obtained by first applying the inverse of the encoding operation that generates the first k output symbols to the source data.
Test variation. Change an implementation or setting while preserving thus, applying the normal encoding operation to the resulting symbols causes the original source symbols to be regenerated as the first k output symbols of the code.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Classification.

Knowledge Transfer¶

Within the home domain. Knowledge about Raptor code transfers literally when a new case preserves the same carrier type, relation, and recognition test. In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver. In the case of non-systematic Raptor codes, the source data to be encoded is used as the input to the pre-coding stage.

Beyond the home domain. No canonical parent is asserted for Raptor code. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

This pre-code may itself be a concatenation of multiple codes, for example in the code standardized by 3GPP a high density parity check code derived from the binary Gray sequence is concatenated with a simple regular low density parity check code. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding; recognition evidence → In the case of systematic Raptor codes, the input to the pre-coding stage is obtained by first applying the inverse of the encoding operation that generates the first k output symbols to the source data

Applied / In Practice¶

In the case of non-systematic Raptor codes, the source data to be encoded is used as the input to the pre-coding stage. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Overview; invariant → In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding; boundary → the case exits the class when (Based on elementary information theory considerations, complete recovery of a source block with k source symbols is not possible if less than k encoding symbols are received.)

Structural Tensions¶

T1 — Stable identity versus admissible variation. (Based on elementary information theory considerations, complete recovery of a source block with k source symbols is not possible if less than k encoding symbols are received.). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. The most advanced version of Raptor is the RaptorQ code defined in IETF . The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. The RaptorQ code is a systematic code, can be implemented in a way to achieve linear time encoding and decoding performance, has near-optimal recovery properties, supports up to 56,403 source symbols, and can support an essentially unlimited number of encoding symbols. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. The RaptorQ code defined in IETF RFC 6330 is specified as a part of the Next Gen TV (ATSC 3.0) standard to enable high quality broadcast video streaming (robust mobile TV) and efficient and reliable broadcast file delivery (datacasting). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Raptor code literally, co-instantiate Classification, or only resemble it?

T6 — Autonomy versus reduction. Raptor codes are formed by the concatenation of two codes. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Raptor code distinguish that the broader parent Classification leaves together?

Structural–Framed Character¶

Raptor code is mixed or framed-leaning. Its structural side is the repeatable organization summarized by In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. Its framed side is the coding theory vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: This pre-code may itself be a concatenation of multiple codes, for example in the code standardized by 3GPP a high density parity check code derived from the binary Gray sequence is concatenated with a simple regular low density parity check code. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Classification. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver. Raptor codes are formed by the concatenation of two codes. It further constrains recognition and variation through: This pre-code may itself be a concatenation of multiple codes, for example in the code standardized by 3GPP a high density parity check code derived from the binary Gray sequence is concatenated with a simple regular low density parity check code. In the case of systematic Raptor codes, the input to the pre-coding stage is obtained by first applying the inverse of the encoding operation that generates the first k output symbols to the source data.

What is domain-bound. coding theory supplies the operative entities, technical vocabulary, warrants, and exceptions that make Raptor code literal. Its documented scope includes the condition that In one approach, each symbol is accompanied with an identifier which can be used as a seed to a pseudo-random number generator to generate this information, with the same process being followed by both sender and receiver. Another bounded application condition is that In the case of non-systematic Raptor codes, the source data to be encoded is used as the input to the pre-coding stage. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—Thus, applying the normal encoding operation to the resulting symbols causes the original source symbols to be regenerated as the first k output symbols of the code.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Error-Correcting Code.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Raptor code. The reviewed identity is: In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Raptor code Domain-specific

Parents (1) — more general patterns this builds on

Raptor code is a kind of Error-Correcting Code Domain-specific

Raptor code satisfies the defining boundary of Error-Correcting Code: An error-correcting code is a specified set of valid codewords together with an encoding map, channel or error model, distance or recoverability structure, and decoding rule that introduces controlled redundancy so transmitted or stored information can be detected or reconstructed despite an admissible class of errors or erasures.

Hierarchy path (1) — routes to 1 parentless root

Raptor code → Error-Correcting Code → Encoding And Decoding → Transformation → Function (Mapping)

Neighborhood in Abstraction Space¶

Raptor code sits in a sparse region of the domain-specific corpus (79^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Even code — 0.83
Generator matrix — 0.83
Mealy machine — 0.82
Conjunctive grammar — 0.82
Randomness extractor — 0.82

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Classification. The parent omits the specialist differentia. Tell: Can the case establish In computer science, Raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding?
Tornado Code. A layered sparse-graph erasure code that performs most encoding and peeling recovery with fast XOR constraints, then protects a much smaller residual layer with a denser outer code. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Luby transform code. A rateless fountain-code construction using sparse random bipartite combinations and XOR operations to recover source symbols from slightly more encoded symbols than the source count. Tell: Which entry's carrier, operation, and failure condition are satisfied?
CPUID. CPUID denotes x86 instruction in computing and information systems. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Raptor code remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside coding theory lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Classification?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Raptor_code (revision 1354867517).
Preserved source candidate: http://bambuser.com/v/1372056
Preserved source candidate: https://www.atsc.org/wp-content/uploads/2016/01/A331S33-174r6-Signaling-Delivery-Sync-FEC.pdf
Preserved source candidate: http://tools.ietf.org/html/rfc6330
Preserved source candidate: http://www.3gpp.org
Preserved source candidate: http://www.dvb.org
Preserved source candidate: http://www.3gpp.org/ftp/Specs/html-info/26346.htm
Preserved source candidate: http://tools.ietf.org/html/rfc5053
Preserved source candidate: http://www.dvb-h-online.org/technology.htm

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.