AbstractWe prove a new characterization of weakly regular ternary bent functions via partial difference sets. Partial difference sets are combinatorial objects corresponding to strongly regular graphs. Using known families of bent functions, we obtain in this way new families of strongly regular graphs, some of which were previously unknown. One of the families includes an example in [N. Hamada, T. Helleseth, A characterization of some {3v2+v3,3v1+v2,3,3}-minihypers and some [15,4,9;3]-codes with B2=0, J. Statist. Plann. Inference 56 (1996) 129–146], which was considered to be sporadic; using our results, this strongly regular graph is now a member of an infinite family. Moreover, this paper contains a new proof that the Coulter–Matthews an...
We study bent functions which are as different as possible from linear functions. Functions that rem...
We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
We prove a new characterization of weakly regular ternary bent functions via partial difference sets...
AbstractWe prove a new characterization of weakly regular ternary bent functions via partial differe...
In this paper, we study two special subsets of a finite field of odd characteristics associated with...
AbstractIn this article a technique for constructing p-ary bent functions from near-bent functions i...
In this paper, we introduce a recursive construction of p-ary bent functions, where p is an odd prim...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Let F be a function from Fpn to itself and δ a positive integer. F is called zero-difference δ-balan...
AbstractCoulter–Matthews (CM) bent functions are from F3n to F3 defined by Tr(ax12(3α+1)), where a∈F...
The article of record as published may be found at https://doi.org/10.1.1016/j.dam.2020.01.026In thi...
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean functio...
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ...
We consider the problem of computing identifying codes of graphs and its frac-tional relaxation. The...
We study bent functions which are as different as possible from linear functions. Functions that rem...
We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
We prove a new characterization of weakly regular ternary bent functions via partial difference sets...
AbstractWe prove a new characterization of weakly regular ternary bent functions via partial differe...
In this paper, we study two special subsets of a finite field of odd characteristics associated with...
AbstractIn this article a technique for constructing p-ary bent functions from near-bent functions i...
In this paper, we introduce a recursive construction of p-ary bent functions, where p is an odd prim...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Let F be a function from Fpn to itself and δ a positive integer. F is called zero-difference δ-balan...
AbstractCoulter–Matthews (CM) bent functions are from F3n to F3 defined by Tr(ax12(3α+1)), where a∈F...
The article of record as published may be found at https://doi.org/10.1.1016/j.dam.2020.01.026In thi...
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean functio...
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ...
We consider the problem of computing identifying codes of graphs and its frac-tional relaxation. The...
We study bent functions which are as different as possible from linear functions. Functions that rem...
We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...