This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
n10https://franpapers.com/en/algorithmic/2018-introduction-to-fountain-codes-lt-codes-with-python/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n13http://www.codeproject.com/Articles/425456/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-zhhttp://zh.dbpedia.org/resource/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Luby_transform_code
rdfs:label
盧比變換碼 Luby transform code
rdfs:comment
盧比變換碼（LT碼，英文：Luby transform codes, LT codes）是第一個最接近完善的抹除碼（erasure correcting codes）的實用湧泉碼（fountain codes），由Michael Luby （页面存档备份，存于互联网档案馆）在1998年發明並於2002年發表。LT碼一個顯著的特徵是採用簡單且基礎的異或（XOR，）來編碼（encode）以及解碼（decode）。 LT碼的另一個特徵是它rateless，由於它可以產生無限量的訊息封包，因此必須將接收到的封包進行解碼的百分比極小。而LT碼之所以屬於抹除碼之一的原因是它可以用在（Binary erasure channel, BEC）上進行傳輸。 In computer science, Luby transform codes (LT codes) are the first class of practical fountain codes that are near-optimal erasure correcting codes. They were invented by Michael Luby in 1998 and published in 2002. Like some other fountain codes, LT codes depend on sparse bipartite graphs to trade reception overhead for encoding and decoding speed. The distinguishing characteristic of LT codes is in employing a particularly simple algorithm based on the exclusive or operation to encode and decode the message.
dcterms:subject
dbc:Coding_theory
dbo:wikiPageID
2172840
dbo:wikiPageRevisionID
1041856004
dbo:wikiPageWikiLink
dbr:Tornado_codes dbr:Raptor_codes dbr:Raptor_code dbr:Fountain_code dbr:Exclusive_or dbr:Binary_erasure_channel dbr:Online_codes dbr:Pseudorandom_number_generator dbc:Coding_theory dbr:Michael_Luby dbr:Cyclic_redundancy_check dbr:Soliton_distribution dbr:Computer_science dbr:Erasure_correcting_code dbr:Bipartite_graph
dbo:wikiPageExternalLink
n10: n13:Your-Digital-Fountain
owl:sameAs
wikidata:Q13563306 dbpedia-zh:盧比變換碼 n11:Mqsy freebase:m.06s84n
dbo:abstract
盧比變換碼（LT碼，英文：Luby transform codes, LT codes）是第一個最接近完善的抹除碼（erasure correcting codes）的實用湧泉碼（fountain codes），由Michael Luby （页面存档备份，存于互联网档案馆）在1998年發明並於2002年發表。LT碼一個顯著的特徵是採用簡單且基礎的異或（XOR，）來編碼（encode）以及解碼（decode）。 LT碼的另一個特徵是它rateless，由於它可以產生無限量的訊息封包，因此必須將接收到的封包進行解碼的百分比極小。而LT碼之所以屬於抹除碼之一的原因是它可以用在（Binary erasure channel, BEC）上進行傳輸。 In computer science, Luby transform codes (LT codes) are the first class of practical fountain codes that are near-optimal erasure correcting codes. They were invented by Michael Luby in 1998 and published in 2002. Like some other fountain codes, LT codes depend on sparse bipartite graphs to trade reception overhead for encoding and decoding speed. The distinguishing characteristic of LT codes is in employing a particularly simple algorithm based on the exclusive or operation to encode and decode the message. LT codes are rateless because the encoding algorithm can in principle produce an infinite number of message packets (i.e., the percentage of packets that must be received to decode the message can be arbitrarily small). They are erasure correcting codes because they can be used to transmit digital data reliably on an erasure channel. The next generation beyond LT codes are Raptor codes (see for example IETF RFC 5053 or IETF RFC 6330), which have linear time encoding and decoding. Raptor codes are fundamentally based on LT codes, i.e., encoding for Raptor codes uses two encoding stages, where the second stage is LT encoding. Similarly, decoding with Raptor codes primarily relies upon LT decoding, but LT decoding is intermixed with more advanced decoding techniques. The RaptorQ code specified in IETF RFC 6330, which is the most advanced fountain code, has vastly superior decoding probabilities and performance compared to using only an LT code.
prov:wasDerivedFrom
wikipedia-en:Luby_transform_code?oldid=1041856004&ns=0
dbo:wikiPageLength
10300
foaf:isPrimaryTopicOf
wikipedia-en:Luby_transform_code
Subject Item
dbr:Soliton_distribution
dbo:wikiPageWikiLink
dbr:Luby_transform_code
Subject Item
dbr:List_of_statistics_articles
dbo:wikiPageWikiLink
dbr:Luby_transform_code
Subject Item
dbr:Lt_code
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
dbr:Luby_Transform_code
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
dbr:LT-Codes
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
dbr:LT_code
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
dbr:LT_codes
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
dbr:Luby_Transform
dbo:wikiPageWikiLink
dbr:Luby_transform_code
dbo:wikiPageRedirects
dbr:Luby_transform_code
Subject Item
wikipedia-en:Luby_transform_code
foaf:primaryTopic
dbr:Luby_transform_code