Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
复制标题
DOI：
10.1109/tit.2011.2176915
复制
发表时间：
2011-11
影响因子：
2.5
通讯作者：
C. Ding
中科院分区：
文献类型：
--
作者：
C. Ding
循环码是一类有趣的线性码，由于其高效的编码和解码算法，在通信和存储系统中有着广泛的应用。本文描述了三种类型的二阶广义割圆，给出并分析了三类长度为n1，n2，维数为（n1，n2 + 1）/2的循环码，其中n1，n2是两个不同的素数.也证明了它们的最小似奇权的界。本文提出的一些码是最好的循环码之一。
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. In this paper, three types of generalized cyclotomy of order two are described and three classes of cyclic codes of length n1 n2 and dimension (n1 n2 + 1)/2 are presented and analyzed, where n1 and n2 are two distinct primes. Bounds on their minimum odd-like weight are also proved. Some of the codes presented in this paper are among the best cyclic codes.