A novel construction method of fountain codes

As the first practical fountain codes, Luby Transform (LT) codes´ performance is greatly affected by the neighbor nodes selection. For most existing LT codes, neighbor nodes are selected randomly, so the encoding process cannot be described by a determined generator matrix. Moreover, this randomness leads to low encoding efficiency when code length is short. Therefore in this paper, a novel LT codes construction method is proposed by defining a LT codes construction matrix with fixed value, which has an advantage in encoding implementation. And Kent map chaos is used for the implementation of construction matrix. Meanwhile, the neighbor nodes selection becomes randomly limited. By using the And-Or tree, an optimization model is built to solve for the optimization solution in selecting neighbor nodes. Simulation results show that the proposed construction method has a better performance in bit error rate (BER) and decoding success rate, which makes it more efficient in reducing decoding overhead.