Related papers: Bent functions and strongly regular graphs
Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…
The concatenation of four Boolean bent functions $f=f_1||f_2||f_3||f_4$ is bent if and only if the dual bent condition $f_1^* + f_2^* + f_3^* + f_4^* =1$ is satisfied. However, to specify four bent functions satisfying this duality…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters yet the existence of many of them is still under the question. Due to this uncertainty, it is of immense interest to study their structure,…
The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…
In this paper, we investigate the complexity of an infinite family of Cayley graphs $\mathcal{D}_{n}=Cay(\mathbb{D}_{n}, b^{\pm\beta_1},b^{\pm\beta_2},\ldots,b^{\pm\beta_s}, a b^{\gamma_1}, a b^{\gamma_2},\ldots, a b^{\gamma_t} )$ on the…
Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…
In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…
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…
We find closed form formulas for Kemeny's constant and its relationship with two Kirchhoffian indices for some composite graphs that use as basic building block a graph endowed with one of several symmetry properties.
In this paper, we give a complete description of strongly regular graphs with parameters ((n^2+3n-1)^2,n^2(n+3),1,n(n+1)). All possible such graphs are: the lattice graph $L_{3,3}$ with parameters (9,4,1,2), the Brouwer-Haemers graph with…
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions,…
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…
In this article, we study bent functions on $\mathbb{F}_2^{2m}$ of the form $f(x,y) = x \cdot \phi(y) + h(y)$, where $x \in \mathbb{F}_2^{m-1} $ and $ y \in \mathbb{F}_2^{m+1}$, which form the generalized Maiorana-McFarland class (denoted…
It has been an active research issue for many years to construct new bent functions. For $k$ odd with $\gcd(n, k)=1$, and $a\in\mathbb{F}_{3^n}^{*}$, the function $f(x)=Tr(ax^{\frac{3^k+1}{2}})$ is weakly regular bent over…
Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…
Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…