相关论文: Linear codes and incidence structures of bent func…
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over…
This paper is devoted to second-order variational analysis of a rather broad class of extended-real-valued piecewise liner functions and their applications to various issues of optimization and stability. Based on our recent explicit…
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
Superposition, the ability of neural networks to represent more features than neurons, is increasingly seen as key to the efficiency of large models. This paper investigates the theoretical foundations of computing in superposition,…
The elastic behavior of materials operating in the linear regime is constrained, by definition, to operations that are linear in the imposed deformation. Though the nonlinear regime holds promise for new functionality, the design in this…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
The concatenation of four Boolean bent functions $f=f_1||f_2||f_3||f_4$ is bent if and only if the dual bent condition $f_1^* + f_2^* + f_3^* + f_4^* =1$ is satisfied. However, to specify four bent functions satisfying this duality…
Monads play an important role in both the syntax and semantics of modern functional programming languages. The problem of combining them has been of profound interest at least since the 90s, and different approaches have been employed to…
Negabent functions were introduced as a generalization of bent functions, which have applications in coding theory and cryptography. In this paper, we have extended the notion of negabent functions to the functions defined from…
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…
We study a certain two-parameter family of non-standard graded complete intersections $A(m,n)$. In case $n=2$, we show that $A(m,2)$ has the strong Lefschetz property and the complex Hodge-Riemann property if and only if $m$ is even. This…
We relate Nekrasov partition functions, with arbitrary values of $\epsilon_1,\epsilon_2$ parameters, to matrix models for $\beta$-ensembles. We find matrix models encoding the instanton part of Nekrasov partition functions, whose measure,…
In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal…
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…
Let $C$ be a two and three-weight ternary code. Furthermore, we assume that $C_\ell$ are $t$-designs for all $\ell$ by the Assmus--Mattson theorem. We show that $t \leq 5$. As a corollary, we provide a new characterization of the (extended)…
In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…
In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph $G(\mathbb{Z}_{n})$ with vertex set is $\mathbb{Z}_{n}$ and two distinct vertices $x$ and $y$ being adjacent if and only…
Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $\lambda$-calculus, the process representations yield (at best) non-extensional $\lambda $-theories (i.e., $\beta$…