Related papers: Geometric representation of binary codes and compu…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…
Let $\mathcal B(\delta)$ be the Brauer category over the complex field $\mathbb C$ with the parameter $\delta$. In non-semisimple case, $\delta$ is an integer, and each weight space of $(\frac{\delta}2-1)$th semi-infinite wedge space…
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…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set.…
Let $(M,g)$ be a Riemannian manifold, and $m$ be a second metric on $M$. We give expressions of $m$'s associated connection, and Riemann curvature tensor $R_m$, in terms of $R_g$ and certain combinations of covariant derivatives of $m$…
In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
The conformal transformations with respect to the metric defining the orthogonal Lie algebra o(n) give rise to a one-parameter (c) family of inhomogeneous first-order differential operator representations of the orthogonal Lie algebra…
We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for…
This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…
Certain integrable hierarchies appearing in random matrix theory, enumerative geometry, and conformal field theory are governed by Virasoro/$W$-algebra constraints and their $W$-representations.Motivated by the Gaussian Hermitian…
We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…
Using geometric algebra and calculus to express the laws of electromagnetism we are able to present magnitudes and relations in a gradual way, escalating the number of dimensions. In the one-dimensional case, charge and current densities,…
Weight enumerators are important tools for deciphering the algebraic structure of the related code spaces and for understanding group actions on these spaces. Our study focuses on symmetrized weight enumerators of pairs of Type II codes…
Linear codes with large minimal distances are important error correcting codes in information theory.Orthogonal codes have more applications in the other fields of mathematics. In this paper, we study the binary and ternary orthogonal codes…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…