TY - GEN
T1 - Quasi-Systematic Doped LT Codes
AU - Yuan, Xiaojun
AU - Ping, Li
PY - 2009/6
Y1 - 2009/6
N2 - We propose a family of binary erasure codes, namely, quasi-systematic doped LT (QS-DLT) codes that are almost systematic, universal, and asymptotically capacity-achieving with encoding and decoding complexity O(K1og(l/ε)), where K is the information length, and E is the overhead. Finite-length analysis is carried out to study the error-floor behavior of our proposed codes. Numerical results verify that our proposed codes provide a low-complexity alternative to systematic Raptor codes with comparable performance.
AB - We propose a family of binary erasure codes, namely, quasi-systematic doped LT (QS-DLT) codes that are almost systematic, universal, and asymptotically capacity-achieving with encoding and decoding complexity O(K1og(l/ε)), where K is the information length, and E is the overhead. Finite-length analysis is carried out to study the error-floor behavior of our proposed codes. Numerical results verify that our proposed codes provide a low-complexity alternative to systematic Raptor codes with comparable performance.
KW - LT codes
KW - Quasi-systematic doped LT (QS-DLT) codes
KW - Raptor codes
UR - http://www.scopus.com/inward/record.url?scp=70449511659&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-70449511659&origin=recordpage
U2 - 10.1109/ISIT.2009.5205946
DO - 10.1109/ISIT.2009.5205946
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781424443130
SN - 9781424443123
SP - 2331
EP - 2335
BT - 2009 IEEE International Symposium on Information Theory - Proceedings
T2 - 2009 IEEE International Symposium on Information Theory (ISIT 2009)
Y2 - 28 June 2009 through 3 July 2009
ER -