- Full text PDF available (5)
- This year (2)
- Last five years (12)
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.
In this paper, some questions on the distribution of the peak-to-mean envelope power ratio (PMEPR) of standard binary Golay sequences are solved. For n odd, we prove that the PMEPR of each standard binary Golay sequence of length 2<sup>n</sup> is exactly 2, and determine the location(s), where peaks occur for each sequence. For n even, we prove that the… (More)
We propose a construction for complementary sets of arrays that exploits a set of mutually-unbiased bases (a MUB). In particular we present, in detail, the construction for complementary pairs that is seeded by a MUB of dimension 2, where we enumerate the arrays and the corresponding set of complementary sequences obtained from the arrays by projection. We… (More)
The construction of permutation trinomials over finite fields attracts people's interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by constructing some new fractional polynomials that permute the set of the (q + 1)-th roots of unity in F q 2… (More)