欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
<正>This paper introduces a Gray map from（Fp + uFp）n to Fp2n,and describes the relationship between codes over Fp + vFp and their Gray images.The authors prove that every cyclic code of arbitrary length n over Fp + vFp is principal,and determine its generator polynomial as well as the number of cyclic codes.Moreover,the authors obtain many best-known p-ary quasic-cyclic codes in terms of their parameters via the Gray map.
英文摘要：
This paper introduces a Gray map from （Fp ＋ vFp）n to F2pn, and describes the relationship between codes over Fp ＋ vFp and their Gray images. The authors prove that every cyclic code of arbitrary length n over Fp ＋ vFp is principal, and determine its generator polynomial as well as the number of cyclic codes. Moreover, the authors obtain many best-known p-ary quasic-cyclic codes in terms of their parameters via the Gray map.
同期刊论文项目
同项目期刊论文
An evidential reasoning based consensus model for multiple attribute group decision analysis problem
An improved ant colony optimization for scheduling identical parallel batching machines with arbitra
A consensus framework for multiple attribute group decision analysis in an evidential reasoning cont
Conjunctive combination of belief functions from dependent sources using positive and negative weigh
Combining QoS prediction and customer satisfaction estimation to solve cloud service trustworthiness
期刊信息
位置：