It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good parameters in general, containing many optimal linear codes. In particular, two open problems about the minimum distance of BCH codes of this type are partially solved in this paper.
翻译：众所周知,循环编码具有高效的编码和解码算法,近年来,反原始的BCH编码引起了许多注意,本文件的目的是研究这种类型的BCH编码对有限领域的影响,并分析其参数。提供了一些关于反原始BCH编码最低距离的较低界限。本文介绍的BCH编码一般都有良好的参数,包含许多最佳线性编码。特别是,关于这种类型的BCH编码最低距离的两个尚未解决的问题在本文件中得到了部分解决。
相关内容
微信扫码咨询专知VIP会员