On Defining Sets of Full Designs with Block Size Three
✍ Scribed by Diane Donovan; James Lefevre; Mary Waterhouse; Emine Şule Yazıcı
- Publisher
- Springer Japan
- Year
- 2009
- Tongue
- English
- Weight
- 205 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## 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
## 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
We determine a necessary and sufficient condition for the existence of a cyclic {3} -GDD with a uniform group size g. Recursive and new computational methods are introduced to settle this problem completely.