Constructions of partitioned difference families

Partitioned difference families (PDFs) arise from constructions of optimum constant composition codes. In this paper, a number of infinite classes of PDFs are constructed, based on known cyclotomic difference families in GF(q)(q). A general approach which obtains PDFs from difference packings and coverings in abelian group is also presented.