Related papers: Normality of 8-Bit Bent Function
A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…
Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…
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…
Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean function, introduce a notion of strong regularity and give several of its properties. We show some connections between this concept and generalized…
We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain…
The Walsh--Hadamard spectrum of a bent function uniquely determines a dual function. The dual of a bent function is also bent. A bent function that is equal to its dual is called a self-dual function. The Hamming distance between a bent…
In this paper, we further investigate properties of generalized bent Boolean functions from $\Z_{p}^n$ to $\Z_{p^k}$, where $p$ is an odd prime and $k$ is a positive integer. For various kinds of representations, sufficient and necessary…
In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…
In this paper, a normality criterion concerning a sequence of meromorphic functions and their differential polynomials is obtained. Precisely, we have proved: Let $\left\{f_j\right\}$ be a sequence of meromorphic functions in the open unit…
A real number is called simply normal to base $b$ if every digit $0,1,\ldots ,b-1$ should appear in its $b$-adic expansion with the same frequency $1/b$. A real number is called normal to base $b$ if it is simply normal to every base $b,…
Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…
In this paper we introduce generalized hyperbent functions from $F_{2^n}$ to $Z_{2^k}$, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions from $F_{2^n}$ to $Z_{2^k}$ consist…
Bent functions from a vector space $V_n$ over $\mathbb F_2$ of even dimension $n=2m$ into the cyclic group $\mathbb Z_{2^k}$, or equivalently, relative difference sets in $V_n\times\mathbb Z_{2^k}$ with forbidden subgroup $\mathbb Z_{2^k}$,…
In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel.…
Monotone Boolean functions (MBFs) are Boolean functions $f: {0,1}^n \rightarrow {0,1}$ satisfying the monotonicity condition $x \leq y \Rightarrow f(x) \leq f(y)$ for any $x,y \in {0,1}^n$. The number of MBFs in n variables is known as the…
A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…
Zhou 2013 introduced modified planar functions to describe $(2^n,2^n,2^n,1)$ relative difference sets $R$ as a graph of a function on the finite field $\F_{2^n}$, and pointed out that projections of $R$ are difference sets that can be…
In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…