A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Doped Accumulate LT Codes
2007
2007 IEEE International Symposium on Information Theory
Preserved Fulltext
We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, that are capacityapproaching on a binary erasure channel (BEC) with bounded encoding and decoding complexity. DALT codes can be either systematic or non-systematic. Non-systematic DALT codes are very similar to raptor codes, except that joint optimization on the full coding graph can be applied to DALT codes, and thus they can be optimized to have better asymptotic performance than raptor codes. Systematic
doi:10.1109/isit.2007.4557156
dblp:conf/isit/Yuan007
fatcat:7ujffflw3re3xpx7v4jljkxusi