Related papers: A note on the Assmus--Mattson theorem for some bin…
A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…
Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…
We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…
We consider an example of vectorial AdS_5/CFT_4 duality when the boundary theory is described by N free complex or real Maxwell fields. It is dual to a particular ("type C") higher spin theory in AdS_5 containing fields in special…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.
Several performance measures are used to evaluate binary and multiclass classification tasks. But individual observations may often have distinct weights, and none of these measures are sensitive to such varying weights. We propose a new…
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…
We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the…
We classify all unitary modular tensor categories (UMTCs) of rank $\leq 4$. There are a total of 70 UMTCs of rank $\leq 4$ (Note that some authors would have counted as 35 MTCs.) In our convention there are two trivial unitary MTCs…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
It has been observed by Assmus and Key as a result of the complete classification of Hadamard matrices of order 24, that the extremality of the binary code of a Hadamard matrix H of order 24 is equivalent to the extremality of the ternary…
Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic…
We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.
We develop a theory of completeness for weight structures on stable categories, dual to the theory of complete t-structures. As in the bounded case, we show that complete weight structures are determined by their weight heart, giving rise…
To each pair consisting of a saturated fusion system over a $p$-group together with a compatible family of K\"ulshammer-Puig cohomology classes, one can count weights in a hypothetical block algebra arising from these data. When the pair…
For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant…
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 give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…