Constructing Permutation Binomials from Permutations of Subfields  

作　　者：QIN Xiaoer YAN Li 

机构地区：[1]College of Mathematics and Statistics,Yangtze Normal University,Chongqing 408100,China [2]School of Mathematical Sciences,Chongqing Normal University,Chongqing 401331,China

出　　处：《Wuhan University Journal of Natural Sciences》2020年第4期330-336,共7页武汉大学学报（自然科学英文版）

基　　金：Supported Partially by the National Natural Science Foundation of China(11926344);Science and Technology Research Projects of Chongqing Municipal Education Commission(KJQN201901402,KJQN201900506);Fund Project of Chongqing Normal University(17XWB021)。

摘　　要：Permutation polynomials is a hot topic in finite fields,they have many applications in different areas.Permutation binomials and trinomials over finite fields were studied recently.In thispaper,by using a powerful lemma given by Zieve and some degree 5 and 6 permutation polynomials over Fq,we construct somepermutation binomials over Fqm.

关 键 词：finite field permutation binomials normalized permutation polynomials 

分 类 号：O174.14[理学—数学]