2013/12/17 by Gaofei Wu, Nian Li, Wu, Gaofei +5
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #cs.IT #math.IT #math.NT
paper · pdf · doi:10.48550/arxiv.1312.4716
17 pages
arxiv created 2013/12/30 · arxiv updated 2013/12/31
In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over \Fqr. In addition, we present a class of complete permutation multinomials, which is a generalization of recent work.