We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction. New examples of interest include an 11-point spherical -design for , and a 12-point spherical -design for given by four Mercedes-Benz frames that lie on equi-isoclinic planes. The latter example shows that the set of optimal spherical designs can be uncountable. We also give results of an extensive numerical study to determine the nature of the real algebraic variety of optimal projective real spherical designs, and in particular when it is a single point (a unique design) or corresponds to an infinite family of designs.
Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order is partitioned into two pairs. Each pair in such a partition is called a nested design pair, and its multiplicity is the number of times it is a pair in this partition. Such a partition of each block is considered a new block design called a nested SQS. Several related questions on this type of design are considered in this paper: What is the maximum multiplicity of the nested design pair with minimum multiplicity? What is the minimum multiplicity of the nested design pair with maximum multiplicity? Are there nested quadruple systems in which all the nested design pairs have the same multiplicity? Of special interest are nested quadruple systems in which all the pairs are nested design pairs with the same multiplicity. Several constructions of nested quadruple systems are considered, and in particular, classic constructions of SQS are examined.
In this paper, we construct new optimal subspace designs and, consequently, new optimal codes in the sum-rank metric. We construct new 1-designs by finding sets of disjoint maximum scattered linear sets, and use these constructions to also find new -designs for . As a means of achieving this, we establish a correspondence between the metric properties of sum-rank metric codes and the geometric properties of subspace designs. Specifically, we determine the geometric counterpart of the coding-theoretic notion of generalised weights for the sum-rank metric in terms of subspace designs and determine a geometric characterisation of MSRD codes. This enables us to characterise subspace designs via their intersections with hyperplanes and via duality operations.
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：