Repeated-root constacyclic codes of length nlp(s)
Repeated-root constacyclic codes of length nlp(s)
复制标题
长度为 nlp(s) 的重根常循环码
DOI：
10.1016/j.disc.2017.04.018
复制
发表时间：
2017
影响因子：
0.8
通讯作者：
Zhu Shixin
中科院分区：
文献类型：
--
作者：
Liu Li;Li Lanqiang;Wang Liqi;Zhu Shixin
本文明确地确定了长度为n l p s / F q的所有重根常环码及其对偶码的生成多项式，其中l是不同于p的奇数素数，n是不同于l和p的奇数素数，使得对于某些素数h或h= 1, n= 2h + 1。此外，我们还给出了所有长度为nl p s / F q的自对偶循环码及其枚举。得到了所有长度为n1p / fq的线性互补对偶（LCD）循环码及其枚举。
In this paper, we explicitly determine the generator polynomials of all repeated-root constacyclic codes of length n l p s over F q and their dual codes, where l is an odd prime different from p, and n is an odd prime different from both l and p such that n= 2 h+ 1 for some prime h or h= 1. Moreover, we give all self-dual cyclic codes of length n l p s over F q and their enumeration. All linear complementary dual (LCD) cyclic codes of length n l p s over F q and their enumeration are also obtained.