首页> 外文期刊>Information Theory, IEEE Transactions on >The Bose and Minimum Distance of a Class of BCH Codes
【24h】

The Bose and Minimum Distance of a Class of BCH Codes

机译:一类BCH码的Bose和最小距离

获取原文
获取原文并翻译 | 示例
           

摘要

Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms. Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices, and consumer electronics. However, the dimension and minimum distance of BCH codes are not known in general. The objective of this paper is to determine the Bose and minimum distances of a class of narrow-sense primitive BCH codes.
机译:循环码由于其高效的编码和解码算法而成为一类有趣的线性码。 Bose-Ray-Chaudhuri-Hocquenghem(BCH)代码构成循环代码的子类,并且在理论和实践上都非常重要,因为它们具有良好的纠错能力,并且广泛用于通信系统,存储设备和消费电子产品中。然而,BCH码的尺寸和最小距离通常是未知的。本文的目的是确定一类狭义的原始BCH码的Bose和最小距离。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号