共 50 条
Repeated-root constacyclic codes of length nlps
被引:4
|作者:
Liu, Li
[1
]
Li, Lanqiang
[1
]
Wang, Liqi
[1
]
Zhu, Shixin
[1
]
机构:
[1] Hefei Univ Technol, Sch Math, Hefei 230009, Anhui, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Finite field;
Repeated-root constacyclic codes;
Cyclic codes;
Dual codes;
Generator polynomial;
CYCLIC CODES;
FINITE-FIELDS;
DUAL CODES;
D O I:
10.1016/j.disc.2017.04.018
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this paper, we explicitly determine the generator polynomials of all repeated-root constacyclic codes of length nlp(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 = 2h + 1 for some prime h or h = 1. Moreover, we give all self-dual cyclic codes of length nlp(s) over F-q and their enumeration. All linear complementary dual (LCD) cyclic codes of length nlp(s) over F-q and their enumeration are also obtained. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:2250 / 2261
页数:12
相关论文