We look at the construction of constant composition codes (CCCs)
from various types of partitions in finite projective spaces. In
particular, we construct robust classes of codes using regular spreads of
and Baer subgeometry
partitions of
.
For each class of codes, we bound the minimum distance by considering how such
partitions can intersect. As such, we prove results about the intersection of regular
spreads and Baer subgeometry partitions, two of the classical partitions generated by
subgroups of a Singer group. In addition, we examine other partitions of objects
embedded in finite projective spaces and their associated codes. In each case, we
compare our codes to a code of comparable parameters that meets the Plotkin
bound.
