Constructing saturating sets in projective spaces using subgeometries
Lins Denaux

TL;DR
This paper constructs new small saturating sets in projective spaces using subgeometries, leading to improved bounds on their size and related covering codes, especially when the field size is a power of a prime.
Contribution
It introduces a novel construction of $ ho$-saturating sets in projective spaces based on subgeometries, improving known upper bounds for their size when the field size is a prime power.
Findings
Constructed $ ho$-saturating sets of size roughly $rac{( ho+1)( ho+2)}{2}q^{rac{N- ho}{ ho+1}}$
Improves upper bounds on the size of $ ho$-saturating sets for certain parameters
Enhances bounds on the length and density of linear covering codes
Abstract
A -saturating set of is a point set such that any point of lies in a subspace of dimension at most spanned by points of . It is generally known that a -saturating set of has size at least , with a constant. Our main result is the discovery of a -saturating set of size roughly if , with an arbitrary prime power. The existence of such a set improves most known upper bounds on the smallest possible size of -saturating sets if . 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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
