Vol. 8, No. 1, 2008

Download this article
Download this article For screen
For printing
Recent Issues
Volume 18
Volume 16
Volume 15
Volume 14
Volume 13
Volume 12
Volume 11
Volume 10
Volume 9
Volume 8
Volume 6+7
Volume 5
Volume 4
Volume 3
Volume 2
Volume 1
The Journal
About the journal
Ethics and policies
Peer-review process
Submission guidelines
Submission form
Editorial board
ISSN (electronic): 2640-7345
ISSN (print): 2640-7337
Author Index
To Appear
Other MSP Journals
Partitions in finite geometry and related constant composition codes

Tim Alderson and Keith E. Mellinger

Vol. 8 (2008), No. 1, 49–71

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 PG(2n 1,q) and Baer subgeometry partitions of PG(2n,q2). 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.

spreads, Baer subgeometry partitions, constant composition codes
Mathematical Subject Classification 2000
Primary: 51E20, 94B60
Received: 6 June 2007
Accepted: 23 January 2008
Tim Alderson
Keith E. Mellinger
Department of Mathematics
University of Mary Washington
1301 College Avenue
Trinkle Hall
Fredericksburg, VA 22401
United States