DocumentCode
2990151
Title
Quasi-systematic doped LT codes
Author
Yuan, Xiaojun ; Ping, Li
Author_Institution
Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong, China
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
2331
Lastpage
2335
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(K log(1/epsiv)), 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.
Keywords
binary codes; decoding; Luby transform code; binary erasure code; decoding complexity; encoding complexity; finite-length analysis; quasisystematic doped LT codes; Algorithm design and analysis; Belief propagation; Code standards; Costs; Decoding; Doping; Encoding; Error probability; Graphics; Parity check codes; LT codes; Raptor codes; quasi-systematic doped LT (QS-DLT) codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205946
Filename
5205946
Link To Document