Implementation of LT Codes with a Revised Robust Soliton Distribution by Using Kent Chaotic Map

Abstract

Fountain codes provide an efficient way to transfer information over erasure channels like Internet. LT codes are the first codes fully realizing the digital fountain concept. The key to make LT codes work well is the degree distribution used in the encoding procedure, which is sampled to determine the degree of each encoding symbol. This paper propose a revised robust soliton distribution which has only one parameter. LT codes with the revised distribution are implemented using Kent chaotic map and pseudo-randomness number generator, respectively. The performance of the revised distribution is compared with a robust soliton distribution and an optimized degree distribution. Simulation results show that regardless of the file size, LT codes with the revised robust soliton distribution have comparable decoding efficiency with robust soliton distribution. Moreover, it reduces the symbol operations numbers in the decoding, which can make the decoding more efficient.