摘要
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.
基金
Supported by the National Natural Science Foundation of China(No.61072030) & Huawei Technologies Foundation
关键词
旋转编码
双向图
误差控制
数据传输
Tornado code
Bipartite graph
Short cycle
Erasure correcting efficiency
