版权说明 操作指南
首页 > 成果 > 详情

On the Hamming distances of repeated-root constacyclic codes of length 4ps

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Dinh, Hai Q.*;Wang, Xiaoqiang;Liu, Hongwei;Sriboonchitta, Songsak
通讯作者:
Dinh, Hai Q.
作者机构:
[Dinh, Hai Q.] Ton Duc Thang Univ, Inst Computat Sci, Div Computat Math & Engn, Ho Chi Minh City, Vietnam.
[Dinh, Hai Q.] Ton Duc Thang Univ, Fac Math & Stat, Ho Chi Minh City, Vietnam.
[Liu, Hongwei; Wang, Xiaoqiang] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Sriboonchitta, Songsak] Chiang Mai Univ, Fac Econ, Chiang Mai 52000, Thailand.
通讯机构:
[Dinh, Hai Q.] T
Ton Duc Thang Univ, Inst Computat Sci, Div Computat Math & Engn, Ho Chi Minh City, Vietnam.
Ton Duc Thang Univ, Fac Math & Stat, Ho Chi Minh City, Vietnam.
语种:
英文
关键词:
Constacyclic code;Generator polynomial;Repeated-root code;Simple-root code;Hamming distance
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2019
卷:
342
期:
5
页码:
1456-1470
基金类别:
The authors sincerely thank the reviewers and the editor for their helpful comments and valuable suggestions, which have greatly improved the presentation of this paper. The second author and the third author were supported by China Scholarship Council (Grant No. 201706770036, 201806770068), NSFC, China (Grant No. 11871025) and the self-determined research funds of CCNU, China from the colleges’ basic research and operation of MOE (Grant No. CCNU18TS028). H.Q. Dinh and S. Sriboonchitta are grateful to the Centre of Excellence in Econometrics, Chiang Mai University, for partial financial support. This research is partially supported by the Research Administration Centre, Chaing Mai University.
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
Let p be an odd prime, s, m be positive integers, gamma, lambda be nonzero elements of the finite field F-pm such that (gamma)p(s) = A. In this paper, we show that, for any positive integer eta, the Hamming distances of all repeated-root lambda-constacyclic codes of length eta p(s) can be determined by those of certain simple-root gamma-constacyclic codes of length eta. Using this result, Hamming distances of all constacyclic codes of length 4p(s) are obtained. As an application, we identify all MDS lambda-constacyclic codes ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com