Some results on the minimum distance structure of cyclic codes
Some results on the minimum distance structure of cyclic codes
复制标题
关于循环码最小距离结构的一些结果
DOI：
10.1109/tit.1972.1054816
复制
发表时间：
1972
期刊：
影响因子：
--
通讯作者：
R. Chien
中科院分区：
文献类型：
--
作者：
C. Hartmann;K. Tzeng;R. Chien
本文给出了有关确定循环码实际最小距离的一些有趣的结果。构造了具有多组连续根的码。确定了奇权码字的最小权值。研究了生成多项式根分布的关系。研究了可逆码的位置多项式。这些结果用于更好地估计许多新循环码的最小距离。
This paper presents a number of interesting results relating to the determination of actual minimum distance of cyclic codes. Codes with multiple sets of consecutive roots are constructed. A bound on the minimum weight of odd-weight codewords is determined. Relations on the distribution of roots of the generator polynomial are investigated. Location polynomials of reversible codes are examined. These results are used to obtain better estimates of the minimum distance of many new cyclic codes.