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.