Author :
Shokrollahi, Amin
Author_Institution :
EPFL Lausanne, Lausanne
Abstract :
A Fountain code is a code of fixed dimension and a limitless block-length. This is a class of codes with many interesting properties and applications. In this talk I will introduce several classes of probabilistic Fountain codes, including LT-and Raptor codes, show tools for their design and analysis, and discuss how they are used today to solve various data transmission problems on heterogenous unreliable networks. I will also talk about the theory of these codes when transmission takes place over non-erasure channels, and low-complexity algorithms are used for their decoding.
Keywords :
channel coding; codes; data communication; LT codes; Raptor codes; data transmission problems; heterogenous unreliable networks; low-complexity algorithms; non-erasure channels; probabilistic Fountain codes; Data communication; Decoding;
Conference_Titel :
Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on
Conference_Location :
Solstrand
Print_ISBN :
978-1-4244-1200-6
Electronic_ISBN :
978-1-4244-1200-6
DOI :
10.1109/ITWITWN.2007.4318034
