Matlab LT (Luby Transform) Code and decode
Invented by Michael Luby in 1998 and published in 2002, Luby transform codes (LT codes) are the first class of practical fountain codes that can achieve the capacity of the binary erasure channel universally. Like some other fountain codes, LT codes depend on sparse bipartite graphs. 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 is Raptor codes, which have linear time encoding and decoding. Raptor codes use two encoding stages for encoding, where the second stage is an LT encoding.