Related papers: A note on the Assmus--Mattson theorem for some bin…
The weak boundedness property associated with a standard alpha-fractional Calderon-Zygmund operator and a weight pair is good-lambda controlled by the testing conditions and the Muckenhoupt and energy side conditions. As a consequence,…
We construct polynomial conformal invariants, the vanishing of which is necessary and sufficient for an $n$-dimensional suitably generic (pseudo-)Riemannian manifold to be conformal to an Einstein manifold. We also construct invariants…
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…
Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…
Using simple modules over the derivation Lie algebra $C[t]\frac{d}{d t}$ of the associative polynomial algebra $C[t]$, we construct new weight Virasoro modules with all weight spaces infinite dimensional. We determine necessary and…
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…
Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it…
A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on…
Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by…
In Wilson's Theorem the primality of a number hinges on a congruence. We present a similar test where the primality of a number m hinges, instead, on the indivisibility of 4(m-5)! by m. One implication of this theorem is a necessary and…
We construct two distinct yet related M-theory models that provide suitable frameworks for the study of knot invariants. We then focus on the four-dimensional gauge theory that follows from appropriately compactifying one of these M-theory…
We formulate the conformal packing problem and dual packing problem in analogy to similar problems for binary codes and lattices. We obtain explicit numerical upper bounds for the minimal dual conformal weight of a unitary strongly-rational…
We consider the conformal $A_{n}$ Toda theory in AdS$_{2}$. Due to the bulk full Virasoro symmetry, this system provides an instance of a non-gravitational $\text{AdS}_{2}$/$\text{CFT}_{1}$ correspondence where the 1d boundary theory enjoys…
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.
We introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…
We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight $n-1$ (where $n$ is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before. Keywords:…
We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general…