Extending t-designs
โ Scribed by W.O Alltop
- Book ID
- 107884803
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 550 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A large set of disjoint S(\*; t, k, v) designs, denoted by LS(\*; t, k, v), is a partition of k-subsets of a v-set into S(\*; t, k, v) designs. In this paper, we develop some recursive methods to construct large sets of t-designs. As an application, we construct infinite families of large sets of t-
We introduce the study of designs in a coset of a binary code which can be held by vectors of a fixed weight. If C is a binary [2n, n, d] code with n odd and the words of weights n -1 and n + 1 hold complementary t-designs, then we show that the vectors of weight n in a coset of weight 1 also hold a
Necessary and sufficient conditions for the extendability of residual designs of Steiner systems S ( t , t + 1, v) are studied. In particular, it is shown that a residual design with respect to a single point is uniquely extendable, and the extendability of a residual design with respect to a pair o