Related papers: On constructing bent functions from cyclotomic map…
In this paper we introduce generalized hyperbent functions from $F_{2^n}$ to $Z_{2^k}$, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions from $F_{2^n}$ to $Z_{2^k}$ consist…
In the Stiefel manifold $X_{n,k}$, we replace Frankel linear height function by a quadratic one. We prove this is still a Morse-Bott function, whose structure of critical levels presents a dichotomy according to the sign of $n-2k$. The…
It is known that crooked functions can be used to construct many interesting combinatorial objects, and a quadratic function is crooked if and only if it is almost perfect nonlinear (APN). In this paper, we introduce two infinite classes of…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…
The present paper provides a generalization of the previous authors' work on Bellman functions for integral functionals on $\mathrm{BMO}$. Those Bellman functions are the minimal locally concave functions on parabolic strips in the plane.…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
The construction of integrity bases for invariant and covariant polynomials built from aset of three dimensional vectors under the SO(3) and O(3) symmetries is presented. Thispaper is a follow--up to our previous work that dealt with a set…
In this paper, we discuss when a class function on a finite group is a bent function. We have found a necessary condition for a class function on a finite abelian group to be bent. Also, we have found a necessary and sufficient condition…
We give explicit expressions for the q-multinomial generalizations of the q-binomials and Andrews' and Baxter's q-trinomials. We show that the configuration sums for the generalized RSOS models in regime III studied by Date et al. can be…
Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…
In this paper, we define and study four families of Berndt-type integrals, called mixed Berndt-type integrals, which contain (hyperbolic) sine and cosine functions in the integrand function. Using contour integration, these integrals are…
In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…
The Brenke type generating functions are the polynomial generating functions of the form $$\sum_{n=0}^{\infty}{P_n(x )\over n!}t^n=A(t)B(xt), $$ where $A$ and $B$ are two formal power series subject to the conditions…
We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…