190 / 2016-12-21 11:10:56
An easily decoded erasure code based on random bipartite graphs
Draft Accepted
柴 朔 / 北京理工大学
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 erasu re 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.
Important Date
  • Conference Date

    Mar 25

    2017

    to

    Mar 26

    2017

  • Nov 10 2016

    Draft paper submission deadline

  • Nov 20 2016

    Draft Paper Acceptance Notification

  • Nov 30 2016

    Final Paper Deadline

  • Mar 26 2017

    Registration deadline

Sponsored By
IEEE Beijing Section
Contact Information