There are five known parameter families for (v, k, λ, n)- difference sets satisfying gcd(v, n)>1: the Hadamard, McFarland, Spence, Davis-Jedwab, and Chen families. The authors recently gave a recursive unifying construction for difference sets from the first four families which relies on relative difference sets. We give an overview of this construction and show that, by modifying it to use divisible difference sets in place of relative difference sets, the recent difference set discoveries of Chen can be brought within the unifying framework. We also demonstrate the recursive use of an auxiliary construction for divisible difference sets by means of an extended example.

Document Type

Book Chapter

Publication Date


Publisher Statement

Copyright © 1999 Chapman & Hall/CRC Press. This chapter first appeared in Combinatorial Designs and Their Applications.

Please note that downloads of the book chapter are for private/personal use only.

Purchase online at Chapman & Hall/CRC Press.