English
Related papers

Related papers: New infinite families of p-ary weakly regular bent…

200 papers

In this article a technique for constructing $p$-ary bent functions from near-bent functions is presented. Two classes of quadratic $p$-ary functions are shown to be near-bent. Applying the construction of bent functions to these classes of…

Combinatorics · Mathematics 2010-11-30 Ayca Cesmelioglu , Gary McGuire , Wilfried Meidl

In \cite{Bapic, Tang, Zheng} a new method for the secondary construction of vectorial/Boolean bent functions via the so-called $(P_U)$ property was introduced. In 2018, Qi et al. generalized the methods in \cite{Tang} for the construction…

Information Theory · Computer Science 2022-11-22 Amar Bapić

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

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

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

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

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…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

In this paper, we generalize the construction of strongly regular graphs in [Y. Tan et al., Strongly regular graphs associated with ternary bent functions, J. Combin.Theory Ser. A (2010), 117, 668-682] from ternary bent functions to $p$-ary…

Combinatorics · Mathematics 2010-11-22 Yeow Meng Chee , Yin Tan , Xian De Zhang

In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

Information Theory · Computer Science 2014-04-14 L. Yu , H. Liu , D. Zheng

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

Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also…

Information Theory · Computer Science 2015-11-10 Ayca Cesmelioglu , Wilfried Meidl , Alexander Pott

The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs…

Information Theory · Computer Science 2018-09-11 Sihem Mesnager , Ahmet Sınak

We obtain an explicit criterion for $p$-ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correlation between $p$-ary bent functions and association schemes;…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Jong Yoon Hyun , Yoonjin Lee

In this paper, a new construction of quaternary bent functions from quaternary quadratic forms over Galois rings of characteristic 4 is proposed. Based on this construction, several new classes of quaternary bent functions are obtained, and…

Discrete Mathematics · Computer Science 2013-09-03 Baofeng Wu , Dongdai Lin

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

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…

Number Theory · Mathematics 2016-05-10 Libo Wang , Baofeng Wu , Zhuojun Liu

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Information Theory · Computer Science 2019-09-24 Josep Rifà , Victor Zinoviev

We construct infinite classes of almost bent and almost perfect nonlinear polynomials, which are affinely inequivalent to any sum of a power function and an affine function.

Combinatorics · Mathematics 2007-05-23 Lilya Budaghyan , Claude Carlet , Alexander Pott

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…

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…

Combinatorics · Mathematics 2024-06-14 Yadi Wei , Jiaxin Wang , Fang-Wei Fu

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…

Combinatorics · Mathematics 2025-08-21 Sadmir Kudin , Enes Pasalic , Alexandr Polujan , Fengrong Zhang , Haixia Zhao

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…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov
‹ Prev 1 2 3 10 Next ›