Partitions in finite geometry and related constant composition codes
type: Item
instance of: scholarly article
title: Partitions in finite geometry and related constant composition codes
zbMATH Open document ID: 1201.51007
author: Tim L. Alderson
author: Keith E. Mellinger
published in: Innovations in Incidence Geometry
publication date: 2010-09-20T00:00:00Z
review text: 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.
reviewed by: Steven T. Dougherty
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 5788609
zbMATH Keywords: spreads
zbMATH Keywords: Baer subgeometry partitions, constant composition codes
MaRDI profile type: Publication
Recommended article: Q3335799
Recommended article: CODING PARTITIONS OF REGULAR SETS
Recommended article: Q3971897
Recommended article: CODES AND SHIFTED CODES OF PARTITIONS
Recommended article: Q4489245
Recommended article: Finite geometries, varieties and codes
Recommended article: Codes on finite geometries
Recommended article: Combinatorial Geometry and Coding Theory*
Recommended article: Perfect codes and regular partitions in graphs and groups
Recommended article: Q3833994
description: scientific article; zbMATH DE number 5788609