Giorgio Faina
Orcid: 0000-0002-0230-7976
According to our database1,
Giorgio Faina
authored at least 32 papers
between 1984 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2018
2017
Electron. Notes Discret. Math., 2017
Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture.
CoRR, 2017
2016
Des. Codes Cryptogr., 2016
2015
Finite Fields Their Appl., 2015
2014
Upper bounds on the smallest size of a complete arc in <i>PG</i>(2, <i>q</i>) under a certain probabilistic conjecture.
Probl. Inf. Transm., 2014
2-semiarcs in PG(2, q), q <sup>2</sup> 13.
Ars Comb., 2014
2013
Finite Fields Their Appl., 2013
Classification of the smallest minimal 1-saturating sets in <i>PG</i>(2, <i>q</i>), <i>q</i>≤23.
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
A new algorithm and a new type of estimate for the smallest size of complete arcs in <i>P</i><i>G</i>(2, <i>q</i>)PG(2, q).
Electron. Notes Discret. Math., 2013
2012
IEEE Trans. Inf. Theory, 2012
Small Complete Caps In Galois Spaces.
Ars Comb., 2012
2011
2010
2009
2008
2005
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.
IEEE Trans. Inf. Theory, 2005
Des. Codes Cryptogr., 2005
2003
2002
2001
Decoding Goppa Codes with MAGMA.
Ars Comb., 2001
1999
On some 10-arcs for deriving the minimum order for complete arcs in small projective planes.
Discret. Math., 1999
1998
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5.
Ars Comb., 1998
1997
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.
Ars Comb., 1997
1984