On plateaued functions, linear structures and permutation polynomials

2019-01-01
We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some applications of our new notion of linear translator to the construction of permutation polynomials. Furthermore, we give explicit classes of permutation polynomials over Fqn using some properties of Fq and some conditions of 2011, Akbary, Ghioca and Wang.

Suggestions

Permutation polynomials and construction of bent functions
Ongan, Pınar; Doğanaksoy, Ali; Temür, Burcu Gülmez; Department of Cryptography (2021-3-03)
This thesis consists of two main parts: In the first part, a study of several classes ofpermutation and complete permutation polynomials is given, while in the second part,a method of construction of several new classes of bent functions is described.The first part consists of the study of several classes of binomials and trinomialsover finite fields. A complete list of permutation polynomials of the formf(x) =xqn−1q−1+1+bx∈Fqn[x]is obtained for the casen= 5, and a criterion on permutationpol...
Finite Bisimulations for Switched Linear Systems
Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2014-12-01)
In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
Finite bisimulations for switched linear systems
Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2013-02-04)
In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
Model-theory of vector-spaces over unspecified fields
Pierce, David (2009-06-01)
Vector spaces over unspecified fields can be axiomatized as one-sorted structures, namely, abelian groups with the relation of parallelism. Parallelism is binary linear dependence. When equipped with the n-ary relation of linear dependence for some positive integer n, a vector-space is existentially closed if and only if it is n-dimensional over an algebraically closed field. In the signature with an n-ary predicate for linear dependence for each positive integer n, the theory of infinite-dimensional vector...
On bounded and unbounded operators
Uyanık, Elif; Yurdakul, Murat Hayrettin; Department of Mathematics (2017)
In this thesis we study on bounded and unbounded operators and obtain some results by considering $ell$-K"{o}the spaces. As a beginning, we introduce some necessary and sufficient conditions for a Cauchy Product map on a smooth sequence space to be continuous and linear and we consider its transpose. We use the modified version of Zahariuta's method to obtain analogous results for isomorphic classification of Cartesian products of K"{o}the spaces. We also investigate the SCBS property and show that all sepa...
Citation Formats
S. Mesnager, K. Kaytancı, and F. Özbudak, “On plateaued functions, linear structures and permutation polynomials,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41074.