Related papers: Octal Bent Generalized Boolean Functions

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…

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…

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…

By using the generalized Bernoulli numbers, we deduce new integral representations for the Riemann zeta function at positive odd-integer arguments. The explicit expressions enable us to obtain criteria for the dimension of the vector space…

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…

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…

We obtain new nonexistence results of generalized bent functions from $\{Z^n}_q$ to $\Z_q$ (called type $[n,q]$) in the case that there exist cyclotomic integers in $ \Z[\zeta_{q}]$ with absolute value $q^{\frac{n}{2}}$. This result…

In literature, it is common to find problems which require a way to encode a finite set of information into a single data; usually means are used for that. An important generalization of means are the so called Aggregation Functions, with a…

The purpose of this paper is to show three general formulas of three global characteristic coefficients of Collatz function. The Collatz function is defined by the following operation on an arbitrary positive integer if N is odd multiply it…

In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular. This paper describes the concept of extended Cayley equivalence of bent functions, discusses some connections between bent functions,…

We investigate subclasses of generalized Bernstein functions related to complete Bernstein and Thorin-Bernstein functions. Representations in terms of incomplete beta and gamma as well as hypergeometric functions are presented. Several…

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…

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…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Let $n$ be an even positive integer, and $m<n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent functions from known bent functions [27, IEEE TIT, 63(10):…

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…

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

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,…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Generalized integral formulas involving the generalized Bessel-Maitland function are considered and it expressed in terms of generalized Wright hypergeometric functions. By assuming appropriate values of the parameters in the main results,…