Partitions in finite geometry and related constant composition codes (Q993645): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:35, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitions in finite geometry and related constant composition codes |
scientific article |
Statements
Partitions in finite geometry and related constant composition codes (English)
0 references
20 September 2010
0 references
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.
0 references
spreads
0 references
Baer subgeometry partitions, constant composition codes
0 references