Constructing saturating sets in projective spaces using subgeometries

DOI10.1007/S10623-021-00951-YzbMATH Open1496.05016arXiv2008.13459OpenAlexW3210494824MaRDI QIDQ2168075FDOQ2168075

Authors: Lins Denaux 

Publication date: 31 August 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: A $varrho$-saturating set of $extPG(N,q)$ is a point set $mathcalS$ such that any point of $extPG(N,q)$ lies in a subspace of dimension at most $varrho$ spanned by points of $mathcalS$. It is generally known that a $varrho$-saturating set of $extPG(N,q)$ has size at least $ccdotvarrho,q^{f}racN-varrhovarrho+1$, with $c>frac13$ a constant. Our main result is the discovery of a $varrho$-saturating set of size roughly $frac(varrho+1)(varrho+2)2q^{f}racN-varrhovarrho+1$ if $q=(q^{\prime }{)}^{varrho+1}$, with $q^{\prime }$ an arbitrary prime power. The existence of such a set improves most known upper bounds on the smallest possible size of $varrho$-saturating sets if $varrho<frac2N-13$. As saturating sets have a one-to-one correspondence to linear covering codes, this result improves existing upper bounds on the length and covering density of such codes. To prove that this construction is a $varrho$-saturating set, we observe that the affine parts of $q^{\prime }$-subgeometries of $extPG(N,q)$ having a hyperplane in common, behave as certain lines of $$. More precisely, these affine lines are the lines of the linear representation of a $q^{\prime }$-subgeometry $extPG(varrho,q^{\prime })$ embedded in $$.

Full work available at URL: https://arxiv.org/abs/2008.13459

Recommendations

• On saturating sets in small projective geometries
• Constructions and families of covering codes and saturated sets of points in projective geometry
• On saturating sets in projective spaces.
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• Linear Codes With Covering Radius&lt;tex&gt;$2$&lt;/tex&gt;,&lt;tex&gt;$3$&lt;/tex&gt;and Saturating Sets in Projective Geometry

zbMATH Keywords

affine spacescovering codessaturating setsprojective spaceslinear representationssubgeometries

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05)

Cites Work

• Field reduction and linear sets in finite geometry
• Title not available (Why is that?)
• Saturated configurations of points in projective Galois spaces
• Unitals in projective planes
• Linear nonbinary covering codes and saturating sets in projective spaces
• Title not available (Why is that?)
• Higgledy-piggledy subspaces and uniform subspace designs
• Lines in higgledy-piggledy arrangement
• On a combinatorial generalization of 27 lines associated with a cubic surface
• Title not available (Why is that?)
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Title not available (Why is that?)
• Linear representations of subgeometries
• On saturating sets in small projective geometries
• Intersections of Baer subgeometries
• Constructions and families of nonbinary linear codes with covering radius 2
• New bounds for linear codes of covering radius 2
• Minimal linear codes arising from blocking sets
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• New bounds for linear codes of covering radii 2 and 3

Cited In (11)

• Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
• Saturating sets in projective planes and hypergraph covers
• On cutting blocking sets and their codes
• Further results on covering codes with radius \(R\) and codimension \(tR+1\)
• New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
• On saturating sets in projective spaces.
• Saturating linear sets of minimal rank
• Outer strong blocking sets
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• On saturating sets in small projective geometries
• Small Strong Blocking Sets by Concatenation

This page was built for publication: Constructing saturating sets in projective spaces using subgeometries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168075)