• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound
【24h】

On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound

机译：Bch码的迭代译码与Bch界限以外的译码

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The work is largely concerned with the decoding problems of error-correcting codes. A direct approach to the solution of Berlekamp's key equation for decoding Bose-Chaudhuri-Hocquenghem codes with the consequent derivation of a modified Berlekamp Iterative Algorithm is presented. Iterative decoding of a syndrome sequence in reverse has been meaningful. A class of reversible cyclic codes is proved to have minimum distance greater than the BCH bound and it has been shown that reverse-sequence iterative decoding is the most natural technique to be coupled with the forward-sequence iterative decoding to decode this class of reversible codes beyond the BCH bound. For cyclic codes with minimum distance greater than their BCH bound, a scheme called syndrome transformation decoding is proposed for decoding the codes beyond their BCH bound. With this scheme, the possible adaption of these codes to be used in compound channels to correct random errors as well as burst errors is shown in an example. Based on the concept of syndrome transformation decoding, cyclic codes for single and multiple solid-burst error correction have been constructed including a simple decoding procedure. (Author)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号