Related papers: A note on the Assmus--Mattson theorem for some bin…
Let $C$ be a four-weight binary code, which has all one vector. Furthermore, we assume that $C$ supports $t$-designs for all weights obtained from the Assmus--Mattson theorem. We previously showed that $t\leq 5$. In the present paper, we…
Let $C$ be a two and three-weight ternary code. Furthermore, we assume that $C_\ell$ are $t$-designs for all $\ell$ by the Assmus--Mattson theorem. We show that $t \leq 5$. As a corollary, we provide a new characterization of the (extended)…
Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…
We prove an Assmus-Mattson-type theorem for block codes where the alphabet is the vertex set of a commutative association scheme (say, with $s$ classes). This in particular generalizes the Assmus-Mattson-type theorems for…
In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…
In the present paper, we give the Assmus--Mattson type theorem for near-extremal Type I and even formally self-dual codes. We show the existence of $1$-designs or $2$-designs for these codes. As a corollary, we prove the uniqueness of a…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings 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…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
Combinatorial $t$-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and $t$-designs has been…
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
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.
In this paper we consider further applications of $(n,m)$-functions for the construction of 2-designs. For instance, we provide a new application of the extended Assmus-Mattson theorem, by showing that linear codes of APN functions with the…
Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.
By the Assmus and Mattson theorem, the codewords of each nontrivial weight in an extremal doubly even self-dual code of length 24m form a self-orthogonal 5-design. In this paper, we study the codes constructed from self-orthogonal 5-designs…
The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…
In this paper, we present examples of codes all of whose weight classes support 1-designs, with duals whose classes include two that support 2-designs. We can find these examples in the triply even binary codes of length 48, which have been…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…