Related papers: Landscape Boolean Functions
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
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…
We study generalizations of two classical primary constructions of Boolean bent functions, namely the Maiorana-McFarland ($MM$) class and the (Desarguesian) partial spread ($\mathcal{PS}_{ap}$) class. The construction of bent functions…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
We introduce the notion of generalized function taking values in a smooth manifold into the setting of full Colombeau algebras. After deriving a number of characterization results we also introduce a corresponding concept of generalized…
Generalized bent (gbent) functions is a class of functions $f: \mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is a positive integer, that generalizes a concept of classical bent functions through their co-domain extension. A lot…
We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are…
In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…
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…
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…
In this paper, we investigate properties of functions from $\mathbb{Z}_{p}^n$ to $\mathbb{Z}_q$, where $p$ is an odd prime and $q$ is a positive integer divided by $p$. we present the sufficient and necessary conditions for bent-ness of…
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…
In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}^n, {H,N}^n and {I,H,N}^n were presented, and the relevance of Local Complementation to the quadratic…
Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…
A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…
In this letter, we give a characterization for a generic construction of bent functions. This characterization enables us to obtain another efficient construction of bent functions and to give a positive answer on a problem of bent…
Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…
Bent functions of the form $\mathbb{F}_2^n\rightarrow\mathbb{Z}_q$, where $q\geqslant2$ is a positive integer, are known as generalized bent (gbent) functions. Gbent functions for which it is possible to define a dual gbent function are…
In this paper, we extend the definition of Boolean canalyzing functions to the canalyzing functions over finite field $\mathbb{F}_{q}$, where $q$ is a power of a prime. We obtain the characterization of all the eight classes of such…
For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…