On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m

被引：0

作者：

Dinh, Hai Q. ^{[1
]}

Nguyen, Bac T. ^{[2
,3
]}

Thi, Hiep L. ^{[4
]}

Yamaka, Woraphon ^{[5
]}

机构：

[1] Kent State Univ, Dept Math Sci, Kent, OH 44240 USA

[2] Duy Tan Univ, Inst Fundamental & Appl Sci, Ho Chi Minh City 550000, Vietnam

[3] Duy Tan Univ, Fac Nat Sci, Da Nang 550000, Vietnam

[4] Thu Dau Mot Univ, Fac Educ, Binh Duong 75100, Vietnam

[5] Chiang Mai Univ, Ctr Excellence Econometr, Chiang Mai 50200, Thailand

来源：

IEEE ACCESS | 2022年 / 10卷

关键词：

Constacyclic codes; cyclic codes; dual codes; chain rings; hamming distance; singleton bound; MDS codes; CONSTACYCLIC CODES; NEGACYCLIC CODES; 2P(S); 3P(S); Z(4);

D O I：

10.1109/ACCESS.2022.3219498

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p<^>{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p<^>{m}}+u\mathbb F_{p<^>{m}}$ , in this paper, the exact values of Hamming distances of all cyclic codes of length $5p<^>{s}$ over $\cal R$ are established. As an application, we identify all maximum distance separable cyclic codes of length $5p<^>{s}$ .

引用

页码：119883 / 119904

页数：22

共 45 条

[1] On the generators of Z4 cyclic codes of length 2e [J].