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

Some minimal cyclic codes over finite fields

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Chen, Bocong*;Liu, Hongwei;Zhang, Guanghui
通讯作者:
Chen, Bocong
作者机构:
[Liu, Hongwei; Chen, Bocong] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Zhang, Guanghui] Luoyang Normal Univ, Sch Math Sci, Luoyang 471022, Henan, Peoples R China.
[Chen, Bocong] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore 637616, Singapore.
通讯机构:
[Chen, Bocong] N
Nanyang Technol Univ, Sch Phys & Math Sci, Singapore 637616, Singapore.
语种:
英文
关键词:
Cyclic code;Hamming distance;Irreducible character;Primitive idempotent;Check polynomial;Minimal cyclic code
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2014
卷:
331
页码:
142-150
基金类别:
The authors would like to thank the anonymous referees for their many helpful comments. The authors are supported by NSFC , Grant No. 11171370 . The research of the first author is partially supported by NSFC, Grant No. 11271005 and Nanyang Technological University ’s research grant number M4080456 . The third author is supported by the Youth Backbone Teacher Foundation of Henan’s Universities (Grant No. 2013GGJS-152 ) and Science and Technology Development Program of Henan Province in 2014 ( 144300510051 ).
机构署名:
本校为第一机构
院系归属:
数学与统计学学院
摘要:
In this paper, the explicit expressions for the generating idempotents, check polynomials and the parameters of all minimal cyclic codes of length tpn over Fq are obtained, where p is an odd prime different from the characteristic of Fq, t and n are positive integers with t (q-1), gcd(t,p)=1 and ordtpn(q)=( pn). Our results generalize the main results in Pruthi and Arora (1997) and Arora and Pruthi (1999), which considered the cases t=1 and t=2 respectively. We propose an approach different from those in Pruthi and Arora (1997) and Arora and Pruthi (1999) to obtain ...

反馈

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

成果认领

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

提示

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

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

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

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