DocumentCode
2019758
Title
Doped Accumulate LT Codes
Author
Xiaojun Yuan ; Li Ping
Author_Institution
City Univ. of Hong Kong, Hong Kong
fYear
2007
fDate
24-29 June 2007
Firstpage
2001
Lastpage
2005
Abstract
We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, that are capacity-approaching on a binary erasure channel (BEC) with bounded encoding and decoding complexity. DALT codes can be either systematic or non-systematic. Non-systematic DALT codes are very similar to raptor codes, except that joint optimization on the full coding graph can be applied to DALT codes, and thus they can be optimized to have better asymptotic performance than raptor codes. Systematic DALT codes, with the proposed protocol, exhibit better performance and lower complexity than their non-systematic counterparts.
Keywords
binary codes; channel capacity; channel coding; graph theory; optimisation; binary erasure channel capacity; bounded decoding complexity; bounded encoding complexity; graph theory; nonsystematic doped accumulate LT codes; optimization; protocol; Channel capacity; Costs; Decoding; Doping; Parity check codes; Performance loss; Propagation losses; Protocols; Strontium; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557156
Filename
4557156
Link To Document