Contents

Ars Combinatoria

  • Research article

On the Construction of Large Sets of Disjoint Group-Divisible Designs

D. Chen1, D.R. Stinson2
1Department of Computer Science University of Manitoba Winnipeg, Manitoba, R3T 2N2 Canada
2 Computer Science and Engineering Department and Center for Communication and Information Science University of Nebraska Lincoln, Nebraska, 68588 USS.A.
  • Published: 30/06/1993

Abstract

In this paper, we give some recursive constructions for large sets of disjoint group-divisible designs with block size \(3\). In particular, we construct new infinite classes of large sets for designs having group-size two. These large sets have applications in cryptography to the construction of perfect threshold schemes.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
D. Chen, D.R. Stinson. On the Construction of Large Sets of Disjoint Group-Divisible Designs[J], Ars Combinatoria, Volume 035. 103-115. DOI: .