| ¡¡ | Chinese Journal of Computers Full Text |
| Title | Construction Algorithm of Bipartite Graphs for Right Regular Erasure Codes` |
| Authors | MU Jian-Jun1) CAO Xun-Zhi1) WANG Xin-Mei2) |
| Address | 1)(School of Computer Science and Technology, Xidian University, Xi¡¯an 710071) 2)(State Key Laboratory of Integrated Service Networks, Xidian University, Xi¡¯an 710071) |
| Year | 2009 |
| Issue | No.7(1331¡ª1336) |
| Abstract & Background | Abstract By investigating analytical properties of the right regular sequences in detail, the parameter-optimization algorithm of degree sequences for right regular erasure codes is designed. Based on this algorithm, the construction algorithm of random bipartite graphs in the designs of right regular erasure codes is proposed. Numerical results demonstrate the effectiveness of the proposed parameter-optimization algorithm of degree sequences. Simulation results show that cascaded erasure codes with right regular sequences outperform Tornado codes in performance. The construction algorithm of random bipartite graphs and the parameter-optimization algorithm of degree sequences presented above will be helpful in the design and engineering application of right regular erasure codes. Keywords erasure channel; right regular erasure codes; Tornado codes; construction algorithm of bipartite graphs |