Raptor codes  are a class  of fountain codes with  very efficient
encoding  and  decoding   algorithms.  Because  of  its  fountain
property,  a Raptor  code can  generated a  potentially limitless
stream   of  output  symbols   for  a   given  vector   of  input
symbols. Very  much like  LDPC codes, their  decoding performance
depends on the fraction of output symbols of various degrees.

In this  talk, I will  introduce a number of  decoding algorithms
for  Raptor   codes  on  various  channels,   and  discuss  their
performance. Part of  what I will be talking  about is joint work
with Harm Cronie and Bertrand Ndzana Ndzana.