相关论文: Association schemes related to Delsarte-Goethals c…
Delsarte theory, more specifically the study of codes and designs in association schemes, has proved invaluable in studying an increasing assortment of association schemes in recent years. Tools motivated by the study of error-correcting…
Association schemes form one of the main objects of algebraic combinatorics, classically defined on finite sets. In this paper we define association schemes on arbitrary, possibly uncountable sets with a measure. We study operator…
In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…
It is known that a Delsarte $t$-design in a $Q$-polynomial association scheme has degree at least $\left \lceil{\frac{t}{2}}\right \rceil $. Following Ionin and Shrikhande who studied combinatorial $(2s-1)$-designs (i.e., Delsarte designs…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
In this paper we aim to characterize association schemes all of whose symmetric fusion schemes have only integral eigenvalues, and classify those obtained from a regular action of a finite group by taking its orbitals.
Real spherical designs and real and complex projective designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code. In contrast,…
An infinite family of nonschurian separable association schemes is constructed.
An infinite family of association schemes obtained from the general unitary groups acting transitively on the sets of isotropic vectors in the finite unitary spaces are investigated. We compute the parameters and determine the character…
In this paper, we obtain classification results for higher-dimensional analogues of classical association schemes called association schemes on triples (ASTs). We present an algorithm that enumerates all ASTs on a fixed number of vertices…
Association schemes on triples (ASTs) are ternary analogues of classical association schemes, whose relations and adjacency algebras are ternary instead of binary. We provide a survey of the current progress in the study of ASTs,…
H. Cohn et. al. proposed an association scheme of 64 points in R^{14} which is conjectured to be a universally optimal code. We show that this scheme has a generalization in terms of Kerdock codes, as well as in terms of maximal real…
{Let ${\Cal X}$ be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices $T$ such that $(PT)^3=I$. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming…
Association schemes on triples (ASTs) are 3-dimensional analogues of classical association schemes. If a group acts two-transitively on a set, the orbits of the action induced on the triple Cartesian product of that set yields an AST. By…
Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asymptotic bounds on such codes is by using Delsarte's theory of…
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…
Let $p$ be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every $p\geq 5$ and two for $p=3$. This construction is explained using incidences between points and lines of a biaffine…
Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…
We construct a 2-category of differential graded schemes. The local affine models in this theory are differential graded algebras, which are graded commutative with unit over a field of characteristic zero, are concentrated in non-positive…
We classify connected \'etale algebras $A$'s in multiplicity-free modular fusion categories $\mathcal B$'s with $\text{rank}(\mathcal B)\le9$. We also identify categories $\mathcal B_A$'s of right $A$-modules. The results have physical…