## 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
✦ LIBER ✦
Orthogonal group divisible designs of type hn for h ≤ 6
✍ Scribed by Xuebin Zhang
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 101 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
For the existence problem of OGDDs of type g^u^, Colbourn and Gibbons settled it with few possible exceptions for each group size g. In this article, we will completely settle it for g ≤ 6. © 2006 Wiley Periodicals, Inc. J Combin Designs
📜 SIMILAR VOLUMES
Large sets of disjoint group-divisible d
✍
H. Cao; J. Lei; L. Zhu
📂
Article
📅
2001
🏛
John Wiley and Sons
🌐
English
⚖ 141 KB
👁 1 views
Further results on large sets of disjoin
✍
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