Partitions in finite geometry and related constant composition codes
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.
- scientific article; zbMATH DE number 3867353
- Coding partitions of regular sets
- scientific article; zbMATH DE number 9818
- Codes and shifted codes of partitions
- scientific article; zbMATH DE number 1472190
- Finite geometries, varieties and codes
- Codes on finite geometries
- Combinatorial geometry and coding theory
- Perfect codes and regular partitions in graphs and groups
- scientific article; zbMATH DE number 4110625
- Algebraic codes and geometry of some classical generalized polygons
- scientific article; zbMATH DE number 4160656 (Why is no real title available?)
- scientific article; zbMATH DE number 2154100 (Why is no real title available?)
- The finest homophonic partition and related code concepts
- The coding power of a product of partitions
This page was built for publication: Partitions in finite geometry and related constant composition codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993645)
