9 citations · 101 across the 70 of their papers we have counts for
5 papers · 2 filters
Classification of minimal 1-saturating sets in ,
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
Minimal 1-saturating sets in the projective plane are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information…
A computer based classification of caps in PG(5,2)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
In this paper we present the complete classification of caps in PG(5,2). These results have been obtained using a computer based exhaustive search that exploits projective equivale…
A computer based classification of caps in PG(4,2)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
In this paper we present the complete classification of caps in PG(4,2). These results have been obtained using a computer based exhaustive search that exploits projective equivale…
A computer based classification of caps in PG(4,3)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
In this paper we present the complete classification of caps in PG(4,3). These results have been obtained using a computer based exhaustive search that exploits projective equivale…
The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial class…