Related papers: Constructing permutations of finite fields via lin…
The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…
Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…
We study compositional inverses of permutation polynomials, complete mappings, mutually orthogonal Latin squares, and bent vectorial functions. Recently it was obtained in [33] the compositional inverses of linearized permutation binomials…
In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…
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…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
Fourier transform of multivariate orthogonal polynomials on the unit ball are obtained. By using Parseval's identity, a new family of multivariate orthogonal functions are introduced. The results are expressed in terms of the continuous…
In this paper we present a finite field analogue for one of the Appell series. We shall derive its transformations, reduction formulas as well as generating functions.
Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…
The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and…
Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…
Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…
We give a method of representing the modular invariant function by generators of a modular function field.
Let $q$ be a power of a prime and $\mathbb{F}_q$ be a finite field with $q$ elements. In this paper, we propose four families of infinite classes of permutation trinomials having the form $cx-x^s + x^{qs}$ over $\mathbb{F}_{q^2}$, and…