共 50 条
On the b-distance of repeated-root constacyclic codes of prime power lengths
被引:9
|作者:
Dinh, Hai Q.
[1
,2
]
Wang, Xiaoqiang
[3
]
Liu, Hongwei
[4
]
Sriboonchitta, Songsak
[5
]
机构:
[1] Ton Duc Thang Univ, Inst Computat Sci, Div Computat Math & Engn, Ho Chi Minh City, Vietnam
[2] Ton Duc Thang Univ, Fac Math & Stat, Ho Chi Minh City, Vietnam
[3] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Peoples R China
[4] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China
[5] Chiang Mai Univ, Fac Econ, Chiang Mai 52000, Thailand
关键词:
Constacyclic code;
Generator polynomial;
Repeated-root code;
Simple-root code;
Hamming distance;
SYMBOL-PAIR CODES;
CYCLIC CODES;
CONSTRUCTIONS;
D O I:
10.1016/j.disc.2019.111780
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let p be a prime, s, m be positive integers, lambda be a nonzero element of the finite field F-pm. The b-distance generalizes the Hamming distance (b = 1), and the symbol-pair distance (b = 2). While the Hamming and symbol-pair distances of all lambda-constacyclic codes of length p(s) are completely determined, the general b-distance of such codes was left opened. In this paper, we provide a new technique to establish the b-distance of all lambda-constacyclic codes of length p(s), where 1 <= b <= left perpendicular p/2 right perpendicular. As an application, all MDS b-symbol constacyclic codes of length p(s) over F-pm are obtained. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文