The saturating density is a characteristic of quality of small saturating sets similar to the covering density of covering codes in coding theory. In particular ...

In particular, the saturating density allows us to see how many times in average the points of a projective space are saturated. We obtained lower bounds on lПn ...

Aug 31, 2020 · Abstract page for arXiv paper 2008.13459: Constructing saturating sets in projective spaces using subgeometries.

Minimal saturating sets in projective spaces PG(n, q) are considered. Estimates and exact values of some extremal parameters are given.

Finite Fields Their Appl. 2024. TLDR. This paper provides construction of saturating linear sets meeting the lower bound ...

Oct 24, 2021 · As saturating sets have a one-to-one correspondence to linear covering codes, this result improves existing upper bounds on the length and ...

In particular the greatest cardinality of a minimal 1-saturating set has been determined. A concept of saturating density is introduced. It allows to obtain new ...

Abstract. Let Πq be an arbitrary finite projective plane of order q. A subset S of its points is called saturating if any point outside S is collinear with ...

A subset S of its points is called a saturating set if any point outside S is collinear with two points in S . In other words, the secants of the point set ...

Jan 14, 2021 · A %-saturating set S of PG(n,q): point set such that. I any point of PG(n,q) lies in span of ⩽ % + 1 points of S.