default search action
Massimo Giulietti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j47]Daniele Bartoli, Massimo Giulietti
, Marco Timpanella
Two-to-one functions from Galois extensions. Discret. Appl. Math. 309: 194-201 (2022) - [j46]Daniele Bartoli, Massimo Giulietti, Gaia Peraro, Giovanni Zini
On monomial generalized almost perfect nonlinear functions. Finite Fields Their Appl. 82: 102050 (2022) - [c2]Massimo Giulietti, Arianna Sabatini, Marco Timpanella:
PIR Codes from Combinatorial Structures. WAIFI 2022: 169-182 - 2021
- [i6]Massimo Giulietti, Arianna Sabatini, Marco Timpanella:
PIR codes from combinatorial structures. CoRR abs/2107.01169 (2021) - 2020
- [j45]Daniele Bartoli, Massimo Giulietti, Motoko Qiu Kawakita, Maria Montanucci
New examples of maximal curves with low genus. Finite Fields Their Appl. 68: 101744 (2020)
2010 – 2019
- 2019
- [j44]Daniele Bartoli, Alexander A. Davydov
New bounds for linear codes of covering radii 2 and 3. Cryptogr. Commun. 11(5): 903-920 (2019) - [j43]Daniele Bartoli
Linear codes from Denniston maximal arcs. Des. Codes Cryptogr. 87(4): 795-806 (2019) - 2018
- [j42]Daniele Bartoli
Maximum Scattered Linear Sets and Complete Caps in Galois Spaces. Comb. 38(2): 255-278 (2018) - [j41]Daniele Bartoli
Permutation polynomials, fractional polynomials, and algebraic curves. Finite Fields Their Appl. 51: 1-16 (2018) - 2017
- [j40]Daniele Bartoli
Constant dimension codes from Riemann-Roch spaces. Adv. Math. Commun. 11(4): 705-713 (2017) - [c1]Daniele Bartoli
New Bounds for Linear Codes of Covering Radius 2. ICMCTA 2017: 1-10 - [i5]Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension. CoRR abs/1702.07939 (2017) - 2016
- [j39]Daniele Bartoli
Further results on multiple coverings of the farthest-off points. Adv. Math. Commun. 10(3): 613-632 (2016) - [j38]Daniele Bartoli
Complete (k, 3)-arcs from quartic curves. Des. Codes Cryptogr. 79(3): 487-505 (2016) - [j37]Alexander A. Davydov
On constructions and parameters of symmetric configurations vk. Des. Codes Cryptogr. 80(1): 125-147 (2016) - [j36]Massimo Giulietti
On maximal curves that are not quotients of the Hermitian curve. Finite Fields Their Appl. 41: 72-88 (2016) - [j35]Daniele Bartoli
On monomial complete permutation polynomials. Finite Fields Their Appl. 41: 132-158 (2016) - 2015
- [j34]Daniele Bartoli
Multiple coverings of the farthest-off points with small density from projective geometry. Adv. Math. Commun. 9(1): 63-85 (2015) - [j33]Daniele Bartoli
On the Covering Radius of MDS Codes. IEEE Trans. Inf. Theory 61(2): 801-811 (2015) - [i4]Daniele Bartoli, Matteo Bonini, Massimo Giulietti:
Constant dimension codes from Riemann-Roch spaces. CoRR abs/1508.01727 (2015) - 2013
- [j32]Massimo Giulietti
Arcs in AG(2, q) determining few directions. Des. Codes Cryptogr. 68(1-3): 61-72 (2013) - [j31]Massimo Giulietti
Transitive A 6-invariant k-arcs in PG(2, q). Des. Codes Cryptogr. 68(1-3): 73-79 (2013) - [j30]Massimo Giulietti
Nakajima's remark on Henn's proof. Electron. Notes Discret. Math. 40: 135-138 (2013) - [j29]Fernanda Pambianco, Alexander A. Davydov
A note on multiple coverings of the farthest-off points. Electron. Notes Discret. Math. 40: 289-293 (2013) - [j28]Daniele Bartoli
Small complete caps in three-dimensional Galois spaces. Finite Fields Their Appl. 24: 184-191 (2013) - [j27]Alexander A. Davydov
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes. Graphs Comb. 29(2): 187-212 (2013) - [p1]Massimo Giulietti:
The geometry of covering codes: small complete caps and saturating sets in Galois spaces. Surveys in Combinatorics 2013: 51-90 - [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
- [j26]Stefania Fanali, Massimo Giulietti
On maximal curves over finite fields of small order. Adv. Math. Commun. 6(1): 107-120 (2012) - 2011
- [j25]Alexander A. Davydov
Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5(1): 119-147 (2011) - 2010
- [j24]Stefania Fanali, Massimo Giulietti
On some open problems on maximal curves. Des. Codes Cryptogr. 56(2-3): 131-139 (2010) - [j23]Massimo Giulietti
On cyclic semi-regular subgroups of certain 2-transitive permutation groups. Discret. Math. 310(22): 3058-3066 (2010) - [j22]Massimo Giulietti
Three-level secret sharing schemes from the twisted cubic. Discret. Math. 310(22): 3236-3240 (2010) - [j21]Stefania Fanali, Massimo Giulietti
One-point AG codes on the GK maximal curves. IEEE Trans. Inf. Theory 56(1): 202-210 (2010)
2000 – 2009
- 2009
- [j20]Massimo Giulietti, Elisa Montanucci:
Abstract Ovals Of Order 9. Ars Comb. 91 (2009) - [j19]Massimo Giulietti
Line partitions of internal points to a conic in PG(2, q). Comb. 29(1): 19-25 (2009) - [j18]Stefania Fanali, Massimo Giulietti
On maximal curves with Frobenius dimension 3. Des. Codes Cryptogr. 53(3): 165-174 (2009) - [i2]Stefania Fanali, Massimo Giulietti:
AG codes on certain maximal curves. CoRR abs/0906.2935 (2009) - [i1]Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Some combinatorial aspects of constructing bipartite-graph codes. CoRR abs/0909.5669 (2009) - 2008
- [j17]Annalisa Beato, Giorgio Faina, Massimo Giulietti:
Arcs in Desarguesian nets. Contributions Discret. Math. 3(1) (2008) - [j16]Massimo Giulietti
On cyclic caps in 4-dimensional projective spaces. Des. Codes Cryptogr. 47(1-3): 135-143 (2008) - [j15]Massimo Giulietti
On automorphism groups of certain Goppa codes. Des. Codes Cryptogr. 47(1-3): 177-190 (2008) - 2007
- [j14]Massimo Giulietti:
On Small Dense Sets in Galois Planes. Electron. J. Comb. 14(1) (2007) - [j13]Massimo Giulietti
Blocking sets of external lines to a conic in PG(2, q), q even. Eur. J. Comb. 28(1): 36-42 (2007) - [j12]Massimo Giulietti
On the completeness of certain n-tracks arising from elliptic curves. Finite Fields Their Appl. 13(4): 988-1000 (2007) - [j11]Massimo Giulietti
Quasi-Perfect Linear Codes With Minimum Distance 4. IEEE Trans. Inf. Theory 53(5): 1928-1935 (2007) - 2006
- [j10]Angela Aguglia, Massimo Giulietti
Blocking Sets of Certain Line Sets Related to a Conic. Des. Codes Cryptogr. 39(3): 397-405 (2006) - [j9]Massimo Giulietti
On hyperfocused arcs in PG(2, q). Discret. Math. 306(24): 3307-3314 (2006) - [j8]Massimo Giulietti
Curves covered by the Hermitian curve. Finite Fields Their Appl. 12(4): 539-564 (2006) - 2004
- [j7]Massimo Giulietti
On the Extendibility of Near-MDS Elliptic Codes. Appl. Algebra Eng. Commun. Comput. 15(1): 1-11 (2004) - [j6]Massimo Giulietti, Fernando Torres:
On Dense Sets Related To Plane Algebraic Curves. Ars Comb. 72 (2004) - 2003
- [j5]Giorgio Faina
On small dense arcs in Galois planes of square order. Discret. Math. 267(1-3): 113-125 (2003) - 2002
- [j4]Massimo Giulietti, Fernanda Pambianco, Fernando Torres, Emanuela Ughi:
On Complete Arcs Arising from Plane Curves. Des. Codes Cryptogr. 25(3): 237-246 (2002) - [j3]Massimo Giulietti:
On cyclic k-arcs of Singer type in PG(2, q). Discret. Math. 255(1-3): 135-144 (2002) - [j2]Massimo Giulietti, Fernanda Pambianco, Fernando Torres
On large complete arcs: odd case. Discret. Math. 255(1-3): 145-159 (2002) - 2001
- [j1]Giorgio Faina, Massimo Giulietti:
Decoding Goppa Codes with MAGMA. Ars Comb. 61 (2001)
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-08-05 20:18 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: