维普中文期刊产品整合服务

Some classes of complete permutation polynomials over Fq

查看全文 作  者:WU [1]GaoFei;LI [2]Nian;HELLESETH [3]Tor;ZHANG [1,4]YuQing 高影响力作者 机构地区:[1]State Key Laboratory of Integrated Service Networks, Xidian University;[2]Information Security and National Computing Grid Laboratory,Southwest Jiaotong University;[3]Department of Informatics, University of Bergen;[4]National Computer Network Intrusion Protection Center,University of Chinese Academy of Sciences高影响力机构 出  处:《Science China Mathematics》索引2015年第58卷第10期,共14页高影响力期刊 基  金:supported by National Natural Science Foundation of China(Grant Nos.61272481 and 61402352);the China Scholarship Council,Beijing Natural Science Foundation(Grant No.4122089);National Development and Reform Commission(Grant No.20121424);the Norwegian Research Council 摘  要:By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work. 关 键 词:置换多项式 充分必要条件 有限域 日本式 单项式 奇素数
相关文献

参考文献(21)

引证文献(2)

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费