𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Further results on large sets of disjoint group-divisible designs

✍ Scribed by D. Chen; C.C. Lindner; D.R. Stinson

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
439 KB
Volume
110
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper is a continuation of a recent paper by Chen and Stinson, where some recursive constructions for large sets of group-divisible design with block size 3 arc presented.

In this paper, we give two new recursive constructions.

In particular, we apply these constructions in the case of designs where every group has size 2.

πŸ“œ SIMILAR VOLUMES

Further results on large sets of disjoin
Further results on large sets of disjoint group-divisible designs with block size three and type 2n41
✍ H. Cao; J. Lei; L. Zhu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 2 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^n^4^1^ were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for __n__ ≑0 (mod 3) and do exist for all odd

Large sets of disjoint group-divisible d
Large sets of disjoint group-divisible designs with block size three and type 2n41
✍ H. Cao; J. Lei; L. Zhu πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 1 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets

Existence of large sets of disjoint grou
Existence of large sets of disjoint group-divisible designs with block size three and type 2n41
✍ L. Ji πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 2 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ (denoted by __LS__ (2^__n__^4^1^)) were first studied by Schellenberg and Stinson and motivated by their connection with perfect threshold schemes. It is known that such large sets can exist only

Further results about large sets of disj
Further results about large sets of disjoint Mendelsohn triple systems
✍ Qingde Kang; Yanxun Chang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 374 KB

In this note, a construction of the large sets of pairwise disjoint Mendelsohn triple systems of order 72k + 6, where k > 1 and k F 1 or 2 (mod 3), is given. Let X be a set of v elements (v 2 3). A cyclic triple from X is a collection of three pairs (x, y), (y,z) and (z, x), where x,y and z are dis

Some results on the existence of large s
Some results on the existence of large sets of t-designs
✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__Ξ½), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi