ﻻ يوجد ملخص باللغة العربية
Four recursive constructions of permutation polynomials over $gf(q^2)$ with those over $gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over $gf(q^{2^ell})$ for any positive integer $ell$ with any given permutation polynomial over $gf(q)$. A generic construction of permutation polynomials over $gf(2^{2m})$ with o-polynomials over $gf(2^m)$ is also presented, and a number of new classes of permutation polynomials over $gf(2^{2m})$ are obtained.
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation polynomials
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In many cases, BCH codes are the best linear codes. However, the dimension and minimum distance of BCH codes have been seldom solved. Until no
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result determine the
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q equiv 1 pmod 4$. Using this method, we improve the best-known min
The previous constructions of quadrature amplitude modulation (QAM) Golay complementary sequences (GCSs) were generalized as $4^q $-QAM GCSs of length $2^{m}$ by Li textsl{et al.} (the generalized cases I-III for $qge 2$) in 2010 and Liu textsl{et al