default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgio Faina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j28]Jürgen Bierbrauer, Daniele Bartoli
, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
A family of semifields in odd characteristic. Des. Codes Cryptogr. 86(3): 611-621 (2018)- 2017
- [j27]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3. Electron. Notes Discret. Math. 57: 15-20 (2017) - [i4]Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture. CoRR abs/1706.01941 (2017) - 2016
- [j26]Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
On constructions and parameters of symmetric configurations vk. Des. Codes Cryptogr. 80(1): 125-147 (2016) - 2015
- [j25]Jürgen Bierbrauer, Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
The nonexistence of an additive quaternary [15, 5, 9]-code. Finite Fields Their Appl. 36: 29-40 (2015) - 2014
- [j24]Daniele Bartoli, Giorgio Faina, György Kiss, Stefano Marcugini, Fernanda Pambianco:
2-semiarcs in PG(2, q), q 2 13. Ars Comb. 117: 435-462 (2014) - [j23]Jürgen Bierbrauer, Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, Yves Edel:
The structure of quaternary quantum caps. Des. Codes Cryptogr. 72(3): 733-747 (2014) - [j22]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Aleksei Andreevich Kreshchuk, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. Probl. Inf. Transm. 50(4): 320-339 (2014) - 2013
- [j21]Giorgio Faina:
Preface. Electron. Notes Discret. Math. 40: 1-2 (2013) - [j20]Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov:
A new algorithm and a new type of estimate for the smallest size of complete arcs in PG(2, q)PG(2, q). Electron. Notes Discret. Math. 40: 27-31 (2013) - [j19]Giorgio Faina, Fabio Pasticci:
On the genus of a cyclic curve over a finite field. Electron. Notes Discret. Math. 40: 117-120 (2013) - [j18]Fernanda Pambianco, Daniele Bartoli, Giorgio Faina, Stefano Marcugini:
Classification of the smallest minimal 1-saturating sets in PG(2, q), q≤23. Electron. Notes Discret. Math. 40: 229-233 (2013) - [j17]Daniele Bartoli, Giorgio Faina, Massimo Giulietti:
Small complete caps in three-dimensional Galois spaces. Finite Fields Their Appl. 24: 184-191 (2013) - [j16]Giorgio Faina, Cristiano Parrettini, Fabio Pasticci:
Embedding 1-Factorizations of K n in PG(2, 32). Graphs Comb. 29(4): 883-892 (2013) - [i3]Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Tables of parameters of symmetric configurations $v_{k}$. CoRR abs/1312.3837 (2013) - 2012
- [j15]Giorgio Faina, Fabio Pasticci, Lorenzo Schmidt:
Small Complete Caps In Galois Spaces. Ars Comb. 105: 299-303 (2012) - [j14]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
On sizes of complete arcs in PG(2, q). Discret. Math. 312(3): 680-698 (2012) - [j13]Marco Calderini, Giorgio Faina:
Generalized Algebraic Geometric Codes From Maximal Curves. IEEE Trans. Inf. Theory 58(4): 2386-2396 (2012) - 2011
- [i2]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in the plane PG(2,q). CoRR abs/1111.3403 (2011) - 2010
- [i1]Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
On sizes of complete arcs in PG(2,q). CoRR abs/1011.3347 (2010)
2000 – 2009
- 2009
- [j12]Jürgen Bierbrauer, Yves Edel, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
Short Additive Quaternary Codes. IEEE Trans. Inf. Theory 55(3): 952-954 (2009) - 2008
- [j11]Annalisa Beato, Giorgio Faina, Massimo Giulietti:
Arcs in Desarguesian nets. Contributions Discret. Math. 3(1) (2008) - 2005
- [j10]Alexander A. Davydov, Giorgio Faina, Fernanda Pambianco:
Constructions of Small Complete Caps in Binary Projective Spaces. Des. Codes Cryptogr. 37(1): 61-80 (2005) - [j9]Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Trans. Inf. Theory 51(12): 4378-4387 (2005) - 2003
- [j8]Giorgio Faina, Massimo Giulietti:
On small dense arcs in Galois planes of square order. Discret. Math. 267(1-3): 113-125 (2003) - 2002
- [j7]Giorgio Faina, György Kiss, Stefano Marcugini, Fernanda Pambianco:
The Cyclic Model for PG(n,q) and a Construction of Arcs. Eur. J. Comb. 23(1): 31-35 (2002) - 2001
- [j6]Giorgio Faina, Massimo Giulietti:
Decoding Goppa Codes with MAGMA. Ars Comb. 61 (2001)
1990 – 1999
- 1999
- [j5]Giorgio Faina, Fernanda Pambianco:
On some 10-arcs for deriving the minimum order for complete arcs in small projective planes. Discret. Math. 208-209: 261-271 (1999) - 1998
- [j4]Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5. Ars Comb. 50 (1998) - 1997
- [j3]Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23. Ars Comb. 47 (1997) - [j2]Giorgio Faina, Fernanda Pambianco:
Small complete caps in PG(r, q), r >= 3. Discret. Math. 174(1-3): 117-123 (1997)
1980 – 1989
- 1984
- [j1]Giorgio Faina:
The B-Ovals of Order q <= 8. J. Comb. Theory A 36(3): 307-314 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
