Quasi-systematic doped LT codes

Authors:
Xiaojun Yuan;Li Ping
Affiliations:
Department of Electronic Engineering, City University of Hong Kong, Hong Kong;Department of Electronic Engineering, City University of Hong Kong, Hong Kong
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 7
Cited 0

A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Capacity-achieving sequences for the erasure channel

IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory
Raptor codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(Klog(1/Ɛ)), where K is the information length, and Ɛ 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.