Luby transform code

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, Luby transform codes (LT codes) are the first class of practical <a href="/facts/Fountain_code/st95SSf8">fountain codes</a> that are near-optimal <a href="/facts/Erasure_correcting_code/ea1C1z2X">erasure correcting codes</a>. They were invented by <a href="/facts/Michael_Luby/gar1k4KJ">Michael Luby</a> in 1998 and published in 2002. Like some other <a href="/facts/Fountain_code/st95SSf8">fountain codes</a>, LT codes depend on sparse <a href="/facts/Bipartite_graph/xWcXV9MB">bipartite graphs</a> 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 <a href="/facts/Exclusive_or/FHyr7hGQ">exclusive or</a> operation (
 
 
 
 ⊕
 
 
 {\displaystyle \oplus }
 
) 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 <a href="/facts/Binary_erasure_channel/qJnFRvl9">erasure channel</a>.
The next generation beyond LT codes are <a href="/facts/Raptor_codes/4LIez9tx">Raptor codes</a> (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.

Luby transform code open-in-new

Luby transform code