Title :
On Systematic LT Codes
Author :
Yuan, Xiaojun ; Ping, Li
Author_Institution :
Dept. of Electr. Eng., City Univ. of Hong Kong, Kowloon
fDate :
9/1/2008 12:00:00 AM
Abstract :
We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives.
Keywords :
channel coding; binary erasure channel; linear decoding complexity; linear encoding complexity; systematic rateless codes; Automatic repeat request; Belief propagation; Channel state information; Costs; Decoding; Doping; Graphics; Polynomials; Transmitters; Raptor codes; Systematic LT codes;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2008.080825
