English
Related papers

Related papers: Construction methods for generalized bent function…

200 papers

In this paper, we consider an approximation method, and a novel general analysis, for second-order elliptic differential equations with heterogeneous multiscale coefficients. We obtain convergence of the Generalized Multi-scale Finite…

Numerical Analysis · Mathematics 2024-12-20 Eduardo Abreu , Ciro Diaz , Juan Galvis

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

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

Combinatorics · Mathematics 2018-12-13 Paul Leopardi

Extension procedure for supermanifold ${\cal M}_{cl}$ of superfields ${\cal A}^{\imath}(\theta)$, ghost number construction are considered. Classical and $\hbar$-deformed generating (master) equations, existence theorems for their solutions…

High Energy Physics - Theory · Physics 2007-05-23 A. A. Reshetnyak

We study a secondary construction of Boolean functions, which generalizes the direct sum and the indirect sum. We detail how these two classic secondary constructions are particular cases of this more general one, as well as two known…

Information Theory · Computer Science 2025-05-20 Claude Carlet , Deng Tang

Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…

Probability · Mathematics 2023-08-09 Christa Cuchiero , Tonio Möllmann , Josef Teichmann

We characterize completely the Gneiting class of space-time covariance functions and give more relaxed conditions on the involved functions. We then show necessary conditions for the construction of compactly supported functions of the…

Methodology · Statistics 2009-02-24 Viktor P. Zastavnyi , Emilio Porcu

This paper is concerned with the construction of positive definite functions on a cartesian product of quasi-metric spaces using generalized Stieltjes and complete Bernstein functions. The results we prove are aligned with a…

Classical Analysis and ODEs · Mathematics 2020-11-20 Victor S. Barbosa , Valdir A. Menegatto

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

For functions $f(z)= z+ a_2 z^2 + a_3 z^3 + \cdots$ in various subclasses of normalized analytic functions, we consider the problem of estimating the generalized Zalcman coefficient functional $\phi(f,n,m;\lambda):=|\lambda a_n a_m…

Complex Variables · Mathematics 2016-11-10 V. Ravichandran , Shelly Verma

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…

Number Theory · Mathematics 2021-05-12 Raouf Rajab

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

We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if…

Cryptography and Security · Computer Science 2021-12-17 Maximilien Gadouleau , Luca Mariot , Stjepan Picek

Depending on the parity of $n$ and the regularity of a bent function $f$ from $\mathbb F_p^n$ to $\mathbb F_p$, $f$ can be affine on a subspace of dimension at most $n/2$, $(n-1)/2$ or $n/2- 1$. We point out that many $p$-ary bent functions…

Number Theory · Mathematics 2017-06-21 Wilfried Meidl , Ísabel Piršić

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…

Computational Complexity · Computer Science 2021-02-24 Guoliang Xu , Daowen Qiu

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

We study the values of the zeta-function of the root system of type $G_2$ at positive integer points. In our previous work we considered the case when all integers are even, but in the present paper we prove several theorems which include…

Number Theory · Mathematics 2016-04-29 Yasushi Komori , Kohji Matsumoto , Hirofumi Tsumura

The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

Combinatorics · Mathematics 2012-11-15 Vladimir Kruchinin

Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding…

Information Theory · Computer Science 2019-05-23 Yanfeng Qi , Sihem Mesnager , Chunming Tang

In this paper we consider further applications of $(n,m)$-functions for the construction of 2-designs. For instance, we provide a new application of the extended Assmus-Mattson theorem, by showing that linear codes of APN functions with the…

Information Theory · Computer Science 2023-05-11 Wilfried Meidl , Alexandr A. Polujan , Alexander Pott
‹ Prev 1 4 5 6 7 8 10 Next ›