Performance improvement of rateless code by non-uniform selection of messages in encoding

LT(Luby transform) encoding is widely used for rateless codes. But uniform choice of messages in the LT encoding process conflicts with the merit of BP(belief propagation) decoding. So more codeword symbols than expected are required for the reliable recovery of message symbols. Thus a new encoding scheme with non-uniform selection of messages that can decrease average overhead and computational complexity is proposed and its performance is analyzed and compared with the conventional encoding scheme in this paper.