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

On the b-distance of repeated-root constacyclic codes of prime power lengths

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Dinh, Hai Q.;Wang, Xiaoqiang*;Liu, Hongwei;Sriboonchitta, Songsak
通讯作者:
Wang, Xiaoqiang
作者机构:
[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.
[Wang, Xiaoqiang] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Peoples R China.
[Liu, Hongwei] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Sriboonchitta, Songsak] Chiang Mai Univ, Fac Econ, Chiang Mai 52000, Thailand.
通讯机构:
[Wang, Xiaoqiang] H
Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Peoples R China.
语种:
英文
关键词:
Constacyclic code;Generator polynomial;Hamming distance;Repeated-root code;Simple-root code
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2020
卷:
343
期:
4
页码:
111780
基金类别:
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 Nos. 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 ). A part of this paper was written during a stay of H.Q. Dinh in the Vietnam Institute For Advanced Study in Mathematics (VIASM), he would like to thank the members of VIASM for their hospitality. H.Q. Dinh and S. Sriboonchitta are grateful to the Centre of Excellence in Econometrics, Chiang Mai University, Thailand , for partial financial support. This research is partially supported by the Research Administration Centre, Chaing Mai University, Thailand .
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
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

反馈

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

成果认领

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

提示

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

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

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

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