Related papers: Construction methods for generalized bent function…
Recently Nikodem, Rajba and W\k{a}sowicz compared the classes of n-Wright-convex functions and n-Jensen-convex functions by showing that the first one is a proper subclass of the latter one, whenever n is an odd natural number. Till now the…
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable…
In literature, it is common to find problems which require a way to encode a finite set of information into a single data; usually means are used for that. An important generalization of means are the so called Aggregation Functions, with a…
A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…
Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…
The closure $\mathcal{M}_{m}^{\#}$ and the extension $\widehat{\mathcal{M}}_{m}$ of the Maiorana--McFarland class $\mathcal{M}_{m}$ in $m = 2n$ variables relative to the extended-affine equivalence and the bent function construction $f…
In the literature, few $n$-variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on $\mathbb{F}_2^{n}$ of the two forms: {\rm (i)}…
We study a new method of constructing Boolean bent functions from cyclotomic mappings. Three generic constructions are obtained by considering different branch functions such as Dillon functions, Niho functions and Kasami functions over…
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…
The purpose of this this paper is to generalize the functors arising from the theory of Witt vectors duto to Cartier. Given a polynomial $g(q)\in \mathbb Z[q]$, we construct a functor ${\overline {W}}^{g(q)}$ from the category of $\mathbb…
A weight function which $q$-generalizes the ground state wave function of the multi-component Calogero-Sutherland quantum many body system is introduced. Conjectures, and some proofs in special cases, are given for a constant term identity…
The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound
In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…
This note contains a simple construction of complete sets of MUBs, using bent functions to write the new basis vectors as explicit linear combinations of the standard basis.
In this paper, we propose a new construction of quadratic bent functions in polynomial forms. Right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 is applied in the proof.
For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
The present article is devoted to one class of generalizations of the Salem functions. To construct such functions by systems of functional equations, the generalized shift operator is used.
We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this problem depends…