Digital Commons Network^™

Almost Difference Sets And Reversible Divisible Difference Sets, James A. Davis

Department of Math & Statistics Faculty Publications

Let G be a group of order mn and N a subgroup of G of order n. If D is a k-subset of G, then D is called a (m, n, k, λ₁, λ₂) divisible difference set (DDS) provided that the differences dd^'-1 for d, d' ∈ D, d ≠ d' contain every nonidentity element of N exactly λ₁ times and every element of G - N exactly λ₂ times. Difference sets are used to generate designs, as described by [4] and [9]. D will be …