Partitioned difference families and almost difference sets

Partitioned difference families (PDFs) were first studied by Ding and Yin in conjunction with the construction of constant composition codes (CCCs). In 2008, Yin et al. presented the constructions of a number of infinite classes of PDFs based on known difference sets in GF(q). In this paper, we further investigate the constructions of PDFs by using known almost difference sets in GF(q), and establish some recursive constructions of PDFs. As their applications, we also get a number of perfect difference systems of sets (DSSs) over Z q 2 with q odd prime.