Encoding and decoding algorithm of LT codes based on chaotic combination and redundancies

According to the traditional encoding and decoding algorithm of LT codes, the degrees and the sets of neighbors of the encoding symbols are chosen uniformly at random via linear congruential method (LCG). The random series generated through this way have poor independence and the disadvantage of correlation between its period and the word size of computer. Those problems considered, chaos map is applied in the implementation of LT codes. The design of the encoding and decoding algorithm of LT codes is based on chaotic combination. In this way, the choice of degrees and the sets of neighbors of the encoding symbols will bring better result. Meanwhile, the exploiting redundancies method is applied to improve the performance of LT decoding. Simulation results show that the encoding and decoding algorithm of LT does based on chaotic combination has the advantage of smaller header packets costs, easier realization. What´s more, its efficiency is higher than that of LCG method. When the number of source samples is small, applying the exploiting redundancies method will further reduce the decoding overhead.