English
Related papers

Related papers: On p-ary Bent Functions and Strongly Regular Graph…

200 papers

In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…

Combinatorics · Mathematics 2021-12-21 Koji Momihara , Qing Xiang

In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a Boolean function $f$ is $s$-plateaued (of weight $=2^{(n+s-2)/2}$) if and only if the…

Combinatorics · Mathematics 2018-07-03 Constanza Riera , Patrick Sole , Pantelimon Stanica

An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…

Combinatorics · Mathematics 2026-04-09 Edwin van Dam , Jack H. Koolen , Yanzhen Xiong

The $p$-ary function $f(x)$ mapping $\mathrm{GF}(p^{4k})$ to $\mathrm{GF}(p)$ given by $f(x)={\rm Tr}_{4k}\big(x^{p^{3k}+p^{2k}-p^k+1}+x^2\big)$ is proven to be a weakly regular bent function and the exact values of its Walsh transform…

Discrete Mathematics · Computer Science 2009-07-21 Tor Helleseth , Alexander Kholosha

Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…

Discrete Mathematics · Computer Science 2026-04-20 Claude Carlet , and Alexander Kholosha

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…

Discrete Mathematics · Computer Science 2024-11-26 Ziran Tu , Sihem Mesnager , Xiangyong Zeng , Nian Li , Yupeng Jiang , Yanan Deng

We use Margulis' construction together with lattice counting arguments to build Cayley graphs on $\mathrm{SL}_{2}\left(\mathbb{F}_{p}\right),\;p\to\infty$ which are d-regular graphs with girth…

Group Theory · Mathematics 2019-10-29 Ofir David

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…

Discrete Mathematics · Computer Science 2023-04-11 Aditi Kar Gangopadhyay , Mansi , Bimal Mandal , Aleksandr Kutsenko , Sugata Gangopadhyay

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

Group Theory · Mathematics 2020-09-25 Peter J. Cameron , Sean Eberhard

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Combinatorics · Mathematics 2014-11-14 S. De Winter , E. Kamischke , Z. Wang

Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study…

Information Theory · Computer Science 2023-09-26 Jiaxin Wang , Fang-Wei Fu , Yadi Wei , Jing Yang

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…

Information Theory · Computer Science 2013-08-14 Chunming Tang , Yanfeng Qi

A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…

Combinatorics · Mathematics 2016-04-01 Yan-Quan Feng , Jin-Xin Zhou , Yan-Tao Li

The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et al. \cite{XCX2015} and $p$-ary bent functions by Xu et al.…

Information Theory · Computer Science 2015-08-25 Yanfeng Qi , Chunming Tang , Zhengchun Zhou , Cuiling Fan

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…

Combinatorics · Mathematics 2024-03-12 Tung T. Nguyen , Nguyen Duy Tân

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…

Combinatorics · Mathematics 2025-11-25 Robert S. Coulter , Steven Senger

In this paper we prove that generalized bent (gbent) functions defined on $\mathbb{Z}_2^n$ with values in $\mathbb{Z}_{2^k}$ are regular, and find connections between the (generalized) Walsh spectrum of these functions and their components.…

Information Theory · Computer Science 2015-11-05 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

We give two "lifting" constructions of strongly regular Cayley graphs. In the first construction we "lift" a cyclotomic strongly regular graph by using a subdifference set of the Singer difference set. The second construction uses quadratic…

Combinatorics · Mathematics 2012-12-27 Koji Momihara , Qing Xiang