𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit

✍ Scribed by Nevena Francetić; Peter Danziger; Eric Mendelsohn

Book ID
115558648
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
722 KB
Volume
21
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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