On saturating sets in small projective geometries
type: Item
instance of: scholarly article
title: On saturating sets in small projective geometries
zbMATH Open document ID: 0971.51004
author: Alexander A. Davydov
author: Patric R. J. Östergård
published in: European Journal of Combinatorics
publication date: 2001-10-28T00:00:00Z
review text: A set of points \(S\) of the projective space \(PG(r,q)\) is said to be \(\rho\)-saturating if for every point \(x\) of \(PG(r,q)\), there exist \(\rho+1\) points in \(S\) that generate a subspace in which \(x\) lies. One of the interesting facts on \(\rho\)-saturating sets is that \(\rho\)-saturating sets in projective geometry correspond to linear codes in coding theory having covering radius \(R=\rho+1\); thus implying that these \(\rho\)-saturating sets are important for both finite geometry and coding theory. The authors concentrate in this article on the parameter \(k(r,q,\rho)\) which denotes the cardinality of a smallest possible \(\rho\)-saturating set \(S\) of \(PG(r,q)\). They survey what is known on \(k(r,q,1)\), present a new upper bound \(k(5,q,2)\leq 3q+1\) for \(q \neq 3\), and a new upper bound on \(k(\rho+1,p^m,\rho)\). The article also contains upper bounds on \(k(r,q,2) \) for \(r=3,4,5\) and \(q \leq 16\).
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 94B75
zbMATH DE Number: 1512031
zbMATH Keywords: saturating sets
zbMATH Keywords: covering radius
reviewed by: Leo Storme
MaRDI profile type: Publication
OpenAlex ID: W2063592207
cites work: Q3319338
cites work: Covering radii of ternary linear codes of small dimensions and codimensions
cites work: Short codes with a given covering radius
cites work: Ternary covering codes derived from BCH codes
cites work: Q4342497
cites work: Constructions and families of covering codes and saturated sets of points in projective geometry
cites work: Constructions and families of nonbinary linear codes with covering radius 2
cites work: Constructions, families, and tables of binary linear covering codes
cites work: New linear codes with covering radius 2 and odd basis
cites work: New quaternary linear codes with covering radius 2
cites work: Linear codes with covering radius 2 and other new covering codes
cites work: On the covering radius of codes
cites work: Q3671186
cites work: Q4370894
cites work: Q4365138
cites work: Some optimal codes from algebraic geometry and their covering radii
cites work: New examples of complete k-arcs in PG(2,q)
cites work: Computer search for small complete caps
cites work: Small complete caps in spaces of even characteristic
cites work: Small complete arcs in Galois planes
cites work: Saturated configurations of points in projective Galois spaces
cites work: On the completeness of certain plane arcs. II
DOI: 10.1006/EUJC.1999.0373
description: scientific article; zbMATH DE number 1512031