相关论文: Linear codes and incidence structures of bent func…
Guided by the generalized conformal symmetry, we investigate the extension of AdS-CFT correspondence to the matrix model of D-particles in the large N limit. We perform a complete harmonic analysis of the bosonic linearized fluctuations…
We consider BPS-counting functions $\mathcal{Z}_{N,M}$ of $N$ parallel M5-branes probing a transverse $\mathbb{Z}_M$ orbifold geometry. These brane web configurations can be dualised into a class of toric non-compact Calabi-Yau threefolds…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
Fixed points in three dimensions described by conformal field theories with $MN_{m,n}= O(m)^n\rtimes S_n$ global symmetry have extensive applications in critical phenomena. Associated experimental data for $m=n=2$ suggest the existence of…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
We investigate the use of the embedding formalism and the Mellin transform in the calculation of tree-level conformal correlation functions in $AdS$/CFT. We evaluate 5- and 6-point Mellin amplitudes in $\phi^3$ theory and even a 12-pt…
In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
We consider correlation functions in 6d $(2,0)$ theories of two $\frac{1}{2}$-BPS operators inserted away from a $\frac{1}{2}$-BPS surface defect. In the large central charge limit the leading connected contribution corresponds to sums of…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
The closure $\mathcal{M}_{m}^{\#}$ and the extension $\widehat{\mathcal{M}}_{m}$ of the Maiorana--McFarland class $\mathcal{M}_{m}$ in $m = 2n$ variables relative to the extended-affine equivalence and the bent function construction $f…
Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of methods to construct linear codes, one of which is based on…
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on…
In this paper we prove that generalized bent (gbent) functions defined on $\mathbb{Z}_2^n$ with values in $\mathbb{Z}_{2^k}$ are regular, and find connections between the (generalized) Walsh spectrum of these functions and their components.…
There are two standard approaches to the construction of $t$-designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding theory. The objective of this paper is to give a spectral…
This study proposes a novel approach that combines theory and data-driven choice models using Artificial Neural Networks (ANNs). In particular, we use continuous vector representations, called embeddings, for encoding categorical or…