Difference systems of sets (DSSs) are combinatorial constructions which were introduced in 1971 by Levenshtein for the construction of codes for synchronization. In this paper, we give further constructions of optimal difference systems of sets from disjoint difference families. As a consequence, new infinite classes of optimal DSSs are obtained.
