Related papers: On the MacWilliams Identity for Classical and Quan…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…
A non-iterative method is presented to calculate the closest Wannier functions (CWFs) to a given set of localized guiding functions, such as atomic orbitals, hybrid atomic orbitals, and molecular orbitals, based on minimization of a…
$W$-representation realizes partition functions by an action of a cut-and-join-like operator on the vacuum state with a zero-mode background. We provide explicit formulas of this kind for $\beta$- and $q,t$-deformations of the simplest…
We present new deterministic algorithms for computing distributed weighted minimum weight cycle (MWC) in undirected and directed graphs and distributed weighted all nodes shortest cycle (ANSC) in directed graphs. Our algorithms for these…
Neural gates compute functions based on weighted sums of the input variables. The expressive power of neural gates (number of distinct functions it can compute) depends on the weight sizes and, in general, large weights (exponential in the…
Variational autoencoders (VAEs) and other generative methods have garnered growing interest not just for their generative properties but also for the ability to dis-entangle a low-dimensional latent variable space. However, few existing…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…
The mark weighted correlation function (MCF) $W(s,\mu)$ is a computationally efficient statistical measure which can probe clustering information beyond that of the conventional 2-point statistics. In this work, we extend the traditional…
Deep convolutional neural networks provide a powerful feature learning capability for image classification. The deep image features can be utilized to deal with many image understanding tasks like image classification and object…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
The wave-function in quantum gravity is supposed to obey the Wheeler-DeWitt (WDW) equation, however there is neither a satisfactory probability interpretation nor a successful solution to the problem of time in the WDW framework. To gain…
The AdS/CFT correspondence is an explicit realization of the holographic principle relating a theory of gravity in a volume of space to a lower dimensional quantum field theory on its boundary. By exploiting elements of quantum error…
The automorphism group of the Barnes-Wall lattice L_m in dimension 2^m (m not 3) is a subgroup of index 2 in a certain ``Clifford group'' C_m (an extraspecial group of order 2^(1+2m) extended by an orthogonal group). This group and its…
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}},…
The union-find decoder is a leading algorithmic approach to the correction of quantum errors on the surface code, achieving code thresholds comparable to minimum-weight perfect matching (MWPM) with amortised computational time scaling…
Peter Denton, Stephen Parke, Terence Tao and Xining Zhang [arxiv 2019] presented a basic and important identity in linear commutative algebra, so-called {\bf the eigenvector-eigenvalue identity} (formally named in [BAMS, 2021]), which is a…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…