Combinatorial designs have been used to construct digital fingerprint codes. Here, a new constructive algorithm for an anticollusion fingerprint code based on group-divisible designs is presented. These codes are easy to construct and available for a large number of individuals, which is important from a business point of view. Group-divisible designs have not been used previously as a tool for...

Let M be an o–minimal expansion of a real closed field. It is known that a definably connected abelian group is divisible. In this note, we show that a definably compact definably connected group is divisible.

We give two new constructions of symmetric group divisible designs using divisible difference sets. These constructions generalize the McFarland and Spence constructions of symmetric designs. Divisible designs are of interest in several parts of mathematics: The design theorist needs classes of divisible designs as "ingredients" for recursive constructions of designs. Statisticians use divisibl...

261 Davis, J.A., New constructions of divisible designs, Discrete Mathematics 120 (1993) 261-268. A construction is given for a (p2"(p+l),p,p2"+ 1(p+l),p2"+ ,p"(p+l)) (pa prime) divisible difference set in the group H x z~.+, where His any abelian group of order p+ 1. This can be used to generate a symmetric semi-regular divisible design; this is a new set of parameters for .l. 1 ;<'0, and thos...

Melissa Keranen∗, Donald Kreher, Artem Zhuravlev, Michigan Technological University A group divisible Steiner quadruple system, is a triple (X,H,B) where X is a v-element set of points, H = {H1, H2, . . . , Hr} is a partition of X into holes and B is a collection of 4-element subsets of X called blocks such that every 3-element subset is either in a block or a hole but not both. We investigate ...