中文摘要：

为了解决高速无线网络中的传输有效性问题,提出一类新的喷泉码机制及其编译码算法,称为中国变换（CT）码.不同于基于因子图和异或（XOR）运算的现有喷泉码机制,该码的编码算法通过在素数集中均匀选取素数将有限长度的原始分组不断分解为包含余数的编码分组,通过混沌位置置乱算法生成编码分组,接收端只要从这些编码分组中接收固定数量的分组,即能以100%的概率恢复译码.仿真实验验证了新喷泉码的机制及构造的有效性.

英文摘要：

A new class of fountain codes named Chinese transform（CT） codes is proposed to solve the problem of the efficient transmission in high speed wireless network.Different from existing fountain codes based on Tanner graph and exclusive OR（XOR） operations,the encoding of CT codes transforms finite original symbols into theoretically infinite encoding symbols which are generated by integers selected uniformly from the set of primes which are then enveloped into packets by chaotic position scrambling algorithm.When enough packets are received from these packets,original symbols can be recovered according to the CT decoding algorithm with 100% probability.Simulation is also shown.