S. Marcugini

activity

20092026

most citedMinimal complete arcs in PG(2,q), q<= 32

13 citations · 66 across the 56 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.IT2017★ 4 cited

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5

Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini +1

The length function $ℓ_{q} (r, R)$ is the smallest length of a $q$ -ary linear code of codimension (redundancy) $r$ and covering radius $R$ . The $d$ -length function $ℓ_{q} (r, R, d)$ i…

math.CO2017★ 2 cited

Upper bounds on the smallest size of a complete cap in $PG (N, q)$ , $N \geq 3$ , under a certain probabilistic conjecture

Alexander A. Davydov, Giorgio Faina, Stefano Marcugini +1

In the projective space $PG (N, q)$ over the Galois field of order $q$ , $N \geq 3$ , an iterative step-by-step construction of complete caps by adding a new point on every step…

math.CO2017

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension

Daniele Bartoli, Alexander Davydov, Massimo Giulietti +2

In a projective plane $Π_{q}$ (not necessarily Desarguesian) of order $q$ , a point subset $S$ is saturating (or dense) if any point of $Π_{q} ∖ S$ is col…

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5

Upper bounds on the smallest size of a complete cap in PG(N,q), N≥3, under a certain probabilistic conjecture

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension

Upper bounds on the smallest size of a complete cap in $PG (N, q)$ , $N \geq 3$ , under a certain probabilistic conjecture