Related papers: Dembowski-Ostrom polynomials and Dickson polynomia…

We discuss the problem of classifying Dembowski-Ostrom polynomials from the composition of reversed Dickson polynomials of arbitrary kind and monomials over finite fields of odd characteristic. Moreover, by using a variant of the Weil bound…

We give a complete classification of Dembowski-Ostram polynomials from reversed Dickson polynomials in odd characteristic.

Let $F_{q}$ be a finite field of cardinality $q$. A polynomial over finite field $F_{q}$ of the form $\sum_{i,j}a_{ij}x^{p^{i}+p^{j}}$ is called a Dembowski-Ostrom (DO) polynomial. The Dembowski-Ostrom conjecture says that a planar…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

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…

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…

Planar functions, introduced by Dembowski and Ostrom, are functions from a finite field to itself that give rise to finite projective planes. They exist, however, only for finite fields of odd characteristics. They have attracted much…

The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…

In [U. Dempwolff: More Translation Planes and Semifields from Dembowski-Ostrom Polynomials, Designs, Codes, Cryptogr. \textbf{68} (1-3) (2013), 81-103], the author gives a construction of three classes of rank two semifields of order…

In this paper we present a new class of perfect nonlinear %Dembowski-Ostrom polynomials over $\mathbb{F}_{p^{2k}}$ for any odd prime $p$. In addition, we show that the new perfect nonlinear functions are CCZ-inequivalent to all the…

Planar functions in odd characteristic were introduced by Dembowski and Ostrom in order to construct finite projective planes in 1968. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and signal…

Krawtchouk polynomials play an important role in coding theory and are also useful in graph theory and number theory. Although the basic properties of these polynomials are to some extent known, there is, to my knowledge, no detailed…

We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

The connection of orthogonal polynomials on the unit circle (OPUC) to the defocusing Ablowitz-Ladik integrable system involves the definition of a Poisson structure on the space of Verblunsky coefficients. In this paper, we compute the…