English
Related papers

Related papers: Bent and $\mathbb Z_{2^k}$-bent functions from spr…

200 papers

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

Combinatorics · Mathematics 2019-07-10 Daniele Bartoli , Maria Montanucci , Giovanni Zini

We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If…

Information Theory · Computer Science 2023-06-01 Xianhong Xie , Yi Ouyang

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

For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li , Juan Luo

In this paper, several new classes of Boolean functions with few Walsh transform values, including bent, semi-bent and five-valued functions, are obtained by adding the product of two or three linear functions to some known bent…

Information Theory · Computer Science 2015-06-17 Guangkui Xu , Xiwang Cao , Shanding Xu

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 consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…

Information Theory · Computer Science 2014-06-05 Sumanta Sarkar

There are two construction methods of designs from $(n,m)$-bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean bent functions, i.e. $(n,1)$-bent functions, and…

Information Theory · Computer Science 2021-05-04 Alexandr Polujan , Alexander Pott

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…

Combinatorics · Mathematics 2007-05-23 Sergey Agievich

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…

Information Theory · Computer Science 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang

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

Partition function of beta-gamma systems on the orbifolds C^2/Z_N and C^3/Z_M x Z_N are obtained as the invariant part of that on the respective affine spaces, by lifting the geometric action of the orbifold group to the fields.…

High Energy Physics - Theory · Physics 2015-06-17 Chandrasekhar Bhamidipati , Koushik Ray

Negabent functions were introduced as a generalization of bent functions, which have applications in coding theory and cryptography. In this paper, we have extended the notion of negabent functions to the functions defined from…

Discrete Mathematics · Computer Science 2022-07-25 Deep Singh , Maheshanand Bhaintwal

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…

Combinatorics · Mathematics 2023-10-17 Alexandr Polujan , Enes Pasalic , Sadmir Kudin , Fengrong Zhang

We present a new result on the nonexistence of generalized bent functions (GBFs)from (Z/tZ)^n to Z/tZ (called type [n, t]) for a large class. Assume p is an odd prime number. By showing certain quadratic norm form equations having no…

Information Theory · Computer Science 2026-03-26 Chang Lv , Yuqing Zhu

In this paper, we investigate Weng zeta functions associated with curves of genus 2 over finite fields. Building upon Weng's framework for non-abelian zeta functions, we establish that, as the rank n tends to infinity, the Riemann…

Algebraic Geometry · Mathematics 2025-11-11 Shi Zhan

We study the bundles of generalized theta functions constructed from moduli spaces of sheaves over abelian surfaces. In degree 0, the splitting type of these bundles is expressed in terms of indecomposable semihomogeneous factors.…

Algebraic Geometry · Mathematics 2019-07-17 Dragos Oprea

We study approximation of Boolean functions by low-degree polynomials over the ring $\mathbb{Z}/2^k\mathbb{Z}$. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{0,1\}$, define its $k$-lift to be $F_k:\{0,1\}^n \rightarrow…

Computational Complexity · Computer Science 2020-05-08 Abhishek Bhrushundi , Prahladh Harsha , Srikanth Srinivasan

Let $n=2m$. In the present paper, we study the binomial Boolean functions of the form $$f_{a,b}(x) = \mathrm{Tr}_1^{n}(a x^{2^m-1 }) +\mathrm{Tr}_1^{2}(bx^{\frac{2^n-1}{3} }), $$ where $m$ is an even positive integer, $a\in…

Information Theory · Computer Science 2021-09-29 Chunming Tang , Peng Han , Qi Wang , Jun Zhang , Yanfeng Qi

For any bent function, it is very interesting to determine its dual function because the dual function is also bent in certain cases. For $k$ odd and $\gcd(n, k)=1$, it is known that the Coulter-Matthews bent function…

Information Theory · Computer Science 2016-05-04 Honggang Hu , Qingsheng Zhang , Shuai Shao