English
Related papers

Related papers: Octal Bent Generalized Boolean Functions

200 papers

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

The general properties of two-dimensional generalized Bessel functions are discussed. Various asymptotic approximations are derived and applied to analyze the basic structure of the two-dimensional Bessel functions as well as their nodal…

Quantum Physics · Physics 2008-08-12 H. J. Korsch , A. Klumpp , D. Witthaut

An analysis of the zeta and gamma function is presented, using elementary functions like [] and {}, a general formula for the angle of zeta(1/2 + i*n) is found and the same for the gamma function.

Number Theory · Mathematics 2013-10-30 Simon Plouffe

Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…

General Mathematics · Mathematics 2025-08-27 Juan Carlos Ku-Cauich , Javier Arturo Díaz-Vargas , Sara Mandujano-Velazquez

A generalised Weber function is given by $\w_N(z) = \eta(z/N)/\eta(z)$, where $\eta(z)$ is the Dedekind function and $N$ is any integer; the original function corresponds to $N=2$. We classify the cases where some power $\w_N^e$ evaluated…

Number Theory · Mathematics 2013-12-23 Andreas Enge , François Morain

In this paper, we determine necessary and sufficient conditions for the generalized Bessel function to be in certain subclasses of starlike and convex functions. Also, we obtain several corollaries as special cases of the main results,…

Complex Variables · Mathematics 2017-12-06 Rabha M. El-Ashwah , Alaa H. El-Qadeem

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…

Computational Complexity · Computer Science 2007-05-23 Scott Aaronson

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

In this paper, we first present a new secondary construction of bent functions (building new bent functions from two already defined ones). Furthermore, we apply the construction using as initial functions some specific bent functions and…

Cryptography and Security · Computer Science 2012-11-20 Fengrong Zhang , Claude Carlet , Yupu Hu , Wenzheng Zhang

Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…

Discrete Mathematics · Computer Science 2014-06-18 Yun Fan , Bangteng Xu

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…

Information Theory · Computer Science 2017-07-18 Honggang Hu , Xiaolong Yang , Shaohua Tang

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…

Information Theory · Computer Science 2018-11-29 S. Hodžić , E. Pasalic , W. G. Zhang

We give closed-form expressions for the Dirichlet beta function at even positive integers and for the Dirichlet lambda function at odd positive integers, based on the function J(s) defined via convergent integral. We also show fundamental…

Number Theory · Mathematics 2014-05-13 JeonWon Kim

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Number Theory · Mathematics 2016-08-22 Jean-Pierre Flori

This research note deals with the evaluation of some generalized beta-type integral operators involving the multi-index Mittag-Leffler function $E_{\epsilon_{i}),(\omega_{i})}(z)$. Further, we derive a new family of beta-type integrals…

Classical Analysis and ODEs · Mathematics 2020-06-16 M. Ali , M. Ghayasuddin , R. B. Paris

Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…

Information Theory · Computer Science 2024-07-03 Peng Han , Keli Pu

The generalization, similarly to exponential multivariate bases in the Fourier transform, of the Bessel functions to many dimensions is offered. Analogously to the Fourier transform property under the differentiation, the similar Hankel…

Classical Analysis and ODEs · Mathematics 2024-10-21 Victor G. Zakharov

In this paper, we discover that any univariate Niho bent function is a sum of functions having the form of Leander-Kholosha bent functions with extra coefficients of the power terms. This allows immediately, knowing the terms of an…

Discrete Mathematics · Computer Science 2014-11-11 Lilya Budaghyan , Alexander Kholosha , Claude Carlet , Tor Helleseth

Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functions that are simultaneously bent and negabent…

Neural and Evolutionary Computing · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Ermes Franch , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell…

Number Theory · Mathematics 2026-04-03 Ayça Çeşmelioğlu , Constanza Riera , Pantelimon Stănică