English
Related papers

Related papers: Octal Bent Generalized Boolean Functions

200 papers

Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

Based on Colombeau's theory of algebras of generalized functions we introduce the concepts of generalized functions taking values in differentiable manifolds as well as of generalized vector bundle homomorphisms. We study their basic…

Functional Analysis · Mathematics 2007-05-23 Michael Kunzinger

We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…

Cryptography and Security · Computer Science 2023-05-02 Augustine Musukwa

Zhou 2013 introduced modified planar functions to describe $(2^n,2^n,2^n,1)$ relative difference sets $R$ as a graph of a function on the finite field $\F_{2^n}$, and pointed out that projections of $R$ are difference sets that can be…

Number Theory · Mathematics 2016-11-15 Nurdagül Anbar , Wilfried Meidl

Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over…

Information Theory · Computer Science 2016-06-30 Gaofei Wu , Nian Li , Yuqing Zhang , Xuefeng Liu

We obtain new nonexistence results for two classes of generalized bent functions from $\mathbb{Z}_{q}^{n}$ to $\mathbb{Z}_{q}$, called type $[n,q]$ generalized bent functions. The first class concerns the case $q=2 p_1^{e_1} p_2^{e_2}$,…

Combinatorics · Mathematics 2026-05-26 Shi Ying , Yingpu Deng

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

The main purpose of this paper is to show some relations between the Riemann zeta function and the generalized Bernoulli polynomials of level $m$. Our approach is based on the use of Fourier expansions for the periodic generalized Bernoulli…

Classical Analysis and ODEs · Mathematics 2019-01-15 Yamilet Quintana , Héctor Torres-Guzmán

In this paper we introduce new generalizations of the zeta function, the Tricomi functions; their main properties are studied. This opens the way to a deeper, better application of these functions both in the theory of special functions,…

Classical Analysis and ODEs · Mathematics 2018-01-01 N. Virchenko , A. Ponomarenko

Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…

Information Theory · Computer Science 2018-11-20 Cunsheng Ding , Sihem Mesnager , Chunming Tang , Maosheng Xiong

In this paper, we introduce a subclass of p-valent non-bazilavec functions of order. Some subordination relations and the inequality properties of p-valent functions are discussed. The results presented here generalize and improve some…

Complex Variables · Mathematics 2019-02-27 A. A. Amourah , A. G. Alamoush , M. Darus

Let $t$ be a fixed parameter and $x$ some indeterminate. We give some properties of the generalized binomial coefficients $\genfrac{<}{>}{0pt}{}{x}{k}$ inductively defined by $k/x \genfrac{<}{>}{0pt}{}{x}{k}=…

Combinatorics · Mathematics 2014-06-20 Michel Lassalle

We obtain new non-existence results of generalized bent functions from \ZZ^n_q to \ZZ_q (called type [n,q]). The first case is a class of types where q=2p_1^{r_1}p_2^{r_2}. The second case contains two types [1 <= n <= 3, 2 * 31^e]$ and [1…

Information Theory · Computer Science 2017-04-07 Chang Lv , Jianing Li

We introduce two kinds of generalized $s$-convex functions on real linear fractal sets $\mathbb{R}^{\alpha}(0<\alpha<1)$. And similar to the class situation, we also study the properties of these two kinds of generalized $s$-convex…

Analysis of PDEs · Mathematics 2014-06-30 Huixia Mo , Xin Sui

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

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…

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

Gel'fand triples of test and generalized functionals in Gaussian spaces are constructed and characterized.

Functional Analysis · Mathematics 2007-05-23 Yu. G. Kondratiev , P. Leukert , J. Potthoff , L. Streit , W. Westerkamp

Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions can be designed using algebraic constructions or…

Neural and Evolutionary Computing · Computer Science 2025-11-18 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek , Alexandr Polujan

Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions,…

Neural and Evolutionary Computing · Computer Science 2023-11-21 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek
‹ Prev 1 4 5 6 7 8 10 Next ›