Quasi-systematic doped LT codes

We propose a family of binary erasure codes, namely, quasi-systematic doped Luby-Transform (QS-DLT) codes, that are rate-less, almost systematic, and universally capacity-achieving without the prior knowledge of channel erasure rate. The encoding and decoding complexities of QS-DLT codes are O(Klog(1/epsiv)), where K is the information length, and epsiv is the overhead. Stopping-set analysis is carried out to study the error-floor behavior of QS-DLT codes. Analysis and numerical results demonstrate that QS-DLT codes provide a low-complexity alternative to systematic Raptor codes with comparable performance.