PRACTICAL ALGORITHMS FOR TORNADO CODES  

作　　者：Ai Da Chang Yilin Luo Zhong Wang Jing 

机构地区：[1]School of Communication Engineering, Xidian University, Xi ＇an 710071, China [2]Huawei Technologies Co.Ltd,, Shenzhen 518129, China

出　　处：《Journal of Electronics(China)》2006年第2期274-276,共3页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.61072030) & Huawei Technologies Foundation

摘　　要：Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect, two algorithms are introduced: (1) while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; (2) in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect, two algorithms are introduced： （1） while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; （2） in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.

关 键 词：Tornado code Bipartite graph Short cycle Erasure correcting efficiency 

分 类 号：TN91[电子电信—通信与信息系统]