An easily decoded erasure code based on random bipartite graphs
in the tornado code,cascading with traditional erasure codes(mostly Reed-Solomon codes)is always used to protect the last level,which will enhance the erasure correcting performance.However,this method increases the complexity in the process of encoding and decoding.In this paper,we introduce an improved algorithm to get linear coding complexity and simplify the implementation of decoder in hardware.The simulation results demonstrate that the code with right non-regular sequences of degree distribution is as good or better than tornado code in error recovery capacity.
random bipartite graph erasure channel peeling decoder tornado code right non-regular sequences of degree distribution
Shuo Chai Hao zheng Wenhui Cao Liwei Shao
School of Information and Electronics Beijing Institute of Technology Beijing,China Research Institute of BIT in Zhongshan,Zhongshan,China
国际会议
重庆
英文
1818-1821
2017-03-25（万方平台首次上网日期，不代表论文的发表时间）