共查询到20条相似文献,搜索用时 15 毫秒
1.
4.
5.
6.
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new construction of MOLS on size a prime power. 相似文献
7.
We use cyclotomy to construct new classes of permutation polynomials over finite fields. This allows us to generate permutation polynomials in an algorithmic way and also to unify several previous constructions. Many permutation polynomials constructed in this way have large indices. 相似文献
8.
9.
10.
11.
In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions. 相似文献
12.
By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping permutation polynomials over finite fields of characteristic three. 相似文献
13.
15.
Guàrdia, Montes and Nart generalized the well-known method of Ore to find complete factorization of polynomials with coe?cients in finite extensions of p-adic numbers using Newton polygons of higher order (cf. [Trans. Amer. Math. Soc. 364 (2012), 361–416]). In this paper, we develop the theory of higher order Newton polygons for polynomials with coe?cients in henselian valued fields of arbitrary rank and use it to obtain factorization of such polynomials. Our approach is different from the one followed by Guàrdia et al. Some preliminary results needed for proving the main results are also obtained which are of independent interest. 相似文献
16.
Very recently, Tu et al. presented a sufficient condition on , see Theorem 1.1, such that is a class of permutation polynomials over with and m odd. In this present paper, we prove that the sufficient condition is also necessary. 相似文献
17.
18.
19.
We obtain exact formulas for the differential spectrum, deficiency and ambiguity of all normalized permutation polynomials of degree up to six over finite fields. 相似文献