TY - GEN
T1 - Doped accumulate LT codes
AU - Yuan, Xiaojun
AU - Ping, Li
PY - 2007
Y1 - 2007
N2 - We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, that are capacity-approaching 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 DALT codes, with the proposed protocol, exhibit better performance and lower complexity than their non-systematic counterparts. ©2007 IEEE.
AB - We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, that are capacity-approaching 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 DALT codes, with the proposed protocol, exhibit better performance and lower complexity than their non-systematic counterparts. ©2007 IEEE.
UR - https://www.scopus.com/pages/publications/51649085574
UR - https://www.scopus.com/pages/publications/51649085574#tab=impact
U2 - 10.1109/ISIT.2007.4557156
DO - 10.1109/ISIT.2007.4557156
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1424414296
SN - 9781424414291
SP - 2001
EP - 2005
BT - IEEE International Symposium on Information Theory - Proceedings
T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Y2 - 24 June 2007 through 29 June 2007
ER -