Quasi-systematic doped LT codes

Authors:
Xiaojun Yuan;Li Ping
Affiliations:
Department of Electrical Engineering, University of Hawaii at Manoa, Hawaii and Department of Electrical Engineering, City University of Hong Kong, HK SAR;Department of Electrical Engineering, City University of Hong Kong, HK SAR
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Year:
2009

Citing 12
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
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Zigzag codes and concatenated zigzag 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
Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary 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 on binary memoryless symmetric channels

IEEE Transactions on Information Theory
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

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 Luby-Transform (QS-DLT) codes, that are rateless, 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/ε)), where K is the information length, and ε 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.