Related papers: A note on the Assmus--Mattson theorem for some bin…
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…
In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…
We prove that the Parker--Semeraro systems satisfy six of the nine Kessar--Linckelmann--Lynd--Semeraro weight conjectures for saturated fusion systems. As a by-product we obtain that Robinson's ordinary weight conjecture holds for the…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
We present two different versions of the consistent theory of massive gravitons in arbitrary spacetimes which are simple enough for practical applications. The theory is described by a non-symmetric rank-2 tensor whose equations of motion…
For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…
In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in [C. Ding, C. Li, Infinite families of 2-designs and 3-designs from linear codes,…
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite…
We use the Terwilliger algebra to provide a new approach to the Assmus-Mattson theorem. This approach also includes another proof of the minimum distance bound shown by Martin as well as its dual.
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…
Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that allows for capturing similarities of numerical…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…
By using invariant theory we show that a (higher-dimensional) Lorentzian metric that is not characterised by its invariants must be of aligned type II; i.e., there exists a frame such that all the curvature tensors are simultaneously of…
In this paper, for an even integer $n\geq 4$ and any positive integer $k$ with ${\rm gcd}(n/2,k)={\rm gcd}(n/2-k,2k)=d$ being odd, a class of $p$-ary codes $\mathcal{C}^k$ is defined and their weight distribution is completely determined,…
We give a new, purely coding-theoretic proof of Koch's criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkov's approach to the classification of…
We prove the basic properties of determinantal semi-invariants for presentation spaces over any finite dimensional hereditary algebra over any field. These include the virtual generic decomposition theorem, stability theorem and the…
A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
The weight-monodromy conjecture claims the coincidence of the weight filtration and the monodromy filtration, up to shift, on the $l$-adic \'etale cohomology of a proper smooth variety over a complete discrete valuation field. Although it…
Let $\mathcal{T}_{+}(E)$ be the tensor algebra of a $W^{*}$-correspondence $E$ over a $W^{*}$-algebra $M$. In earlier work, we showed that the completely contractive representations of $\mathcal{T}_{+}(E)$, whose restrictions to $M$ are…