Verification decoding of raptor codes

In this paper we extend the double verification algorithm of Luby and Mitzenmacher to the class of Raptor codes, analyze it, and design Raptor codes that perform very well with respect to this algorithm

[1]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[3]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[4]  Eugen Lupu,et al.  On the speaker verification using the TESPAR coding method , 2003, Signals, Circuits and Systems, 2003. SCS 2003. International Symposium on.

[5]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[6]  Omid Etesami,et al.  Raptor codes on symmetric channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[7]  Wei Wang,et al.  Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[8]  M. Luby,et al.  Verification Codes , 2002 .