190 / 2016-12-21 11:10:56
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 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.
重要日期
  • 会议日期

    03月25日

    2017

    03月26日

    2017

  • 11月10日 2016

    初稿截稿日期

  • 11月20日 2016

    初稿录用通知日期

  • 11月30日 2016

    终稿截稿日期

  • 03月26日 2017

    注册截止日期

主办单位
IEEE Beijing Section
联系方式
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询