Partitions in finite geometry and related constant composition codes (Q993645)

Let \(C\) be a \(k\)-ary code of length \(n\) and minimum distance \(d\). If every codeword has \(n_i\) occurences of the \(i\)-th symbol then it has constant weight composition \([n_1,n_2,\dots,n_k]\) and the code is called a constant composition code. The authors give new constructions of constant composition codes from partitions in finite projective spaces. They construct infinite classes of codes from regular spreads of \(PG(2n-1,q)\) and Baer subgeometry partitions of \(PG(2n,q^2)\) and bound the minimum distance from the intersection properties of the partition. Additionally, they produce results about the intersections of regular spreads and Baer subgeometry partitions.