![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Francesco Pavese
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j44]Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese:
Combining subspace codes. Adv. Math. Commun. 17(3): 536-550 (2023) - [j43]Dean Crnkovic, Francesco Pavese, Andrea Svob:
Intriguing sets of strongly regular graphs and their related structures. Contributions Discret. Math. 18(1): 66-89 (2023) - [j42]Michela Ceria, Antonio Cossidente, Giuseppe Marino, Francesco Pavese
:
On near-MDS codes and caps. Des. Codes Cryptogr. 91(3): 1095-1110 (2023) - [j41]Michel Lavrauw, Stefano Lia
, Francesco Pavese:
On the geometry of the Hermitian Veronese curve and its quasi-Hermitian surfaces. Discret. Math. 346(10): 113582 (2023) - [j40]Michela Ceria, Francesco Pavese
:
On the geometry of a (q + 1)-arc of PG(3,q), q even. Discret. Math. 346(12): 113594 (2023) - [i7]Francesco Pavese:
On 4-general sets in finite projective spaces. CoRR abs/2305.13838 (2023) - 2022
- [j39]Angela Aguglia, Antonio Cossidente, Giuseppe Marino, Francesco Pavese, Alessandro Siciliano:
Orbit codes from forms on vector spaces over a finite field. Adv. Math. Commun. 16(1): 135-155 (2022) - [j38]Sam Mattheus
, Francesco Pavese
:
A clique-free pseudorandom subgraph of the pseudo polarity graph. Discret. Math. 345(7): 112871 (2022) - [j37]Antonio Cossidente, Giuseppe Marino, Francesco Pavese, Valentino Smaldore
:
On regular systems of finite classical polar spaces. Eur. J. Comb. 100: 103439 (2022) - [j36]Michela Ceria, Francesco Pavese:
The m-ovoids of W(5, 2) and their generalizations. Finite Fields Their Appl. 84: 102098 (2022) - [j35]Antonio Cossidente, Giuseppe Marino, Francesco Pavese:
On symmetric and Hermitian rank distance codes. J. Comb. Theory A 188: 105597 (2022) - 2021
- [j34]Ferdinand Ihringer
, Francesco Pavese
, Valentino Smaldore
:
Graphs cospectral with NU(n + 1, q2), n ≠ 3. Discret. Math. 344(11): 112560 (2021) - 2020
- [j33]Francesco Pavese
:
On q-Covering Designs. Electron. J. Comb. 27(1): 1 (2020) - [j32]Angela Aguglia, Francesco Pavese
:
On non-singular Hermitian varieties of PG(4, q2). Discret. Math. 343(1): 111634 (2020) - [j31]Angela Aguglia, Francesco Pavese
:
On multiple blocking sets and blocking semiovals in finite non-Desarguesian planes. Finite Fields Their Appl. 62: 101624 (2020) - [j30]Dean Crnkovic
, Francesco Pavese
, Andrea Svob
:
On the $\mathrm{PSU}(4, 2)$-Invariant Vertex-Transitive Strongly Regular (216, 40, 4, 8) Graph. Graphs Comb. 36(3): 503-513 (2020) - [i6]Antonio Cossidente, Giuseppe Marino, Francesco Pavese:
On symmetric and Hermitian rank distance codes. CoRR abs/2011.06942 (2020) - [i5]Daniele Bartoli, Antonio Cossidente, Giuseppe Marino, Francesco Pavese:
On cutting blocking sets and their codes. CoRR abs/2011.11101 (2020)
2010 – 2019
- 2019
- [j29]Antonio Cossidente, Francesco Pavese
, Leo Storme
:
Optimal subspace codes in $ {{\rm{PG}}}(4, q) $. Adv. Math. Commun. 13(3): 393-404 (2019) - [j28]Antonio Cossidente, Francesco Pavese
:
On line covers of finite projective and polar spaces. Des. Codes Cryptogr. 87(9): 1985-2002 (2019) - [j27]Antonio Cossidente, Giuseppe Marino
, Francesco Pavese
:
The covering radius of PGL(3, q). Discret. Math. 342(3): 664-670 (2019) - [j26]Antonio Cossidente, Francesco Pavese
:
Relative m-ovoids of elliptic quadrics. Discret. Math. 342(5): 1481-1488 (2019) - [j25]Antonio Cossidente, Francesco Pavese
:
Cameron-Liebler line classes of PG(3, q) admitting PGL(2, q). J. Comb. Theory A 167: 104-120 (2019) - [j24]Sam Mattheus
, Francesco Pavese
, Leo Storme
:
On the independence number of graphs related to a polarity. J. Graph Theory 92(2): 96-110 (2019) - [i4]Antonio Cossidente, Giuseppe Marino, Francesco Pavese:
Subspace code constructions. CoRR abs/1905.11021 (2019) - [i3]Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese:
Combining subspace codes. CoRR abs/1911.03387 (2019) - 2018
- [j23]Antonio Cossidente, Francesco Pavese
:
On intriguing sets of finite symplectic spaces. Des. Codes Cryptogr. 86(5): 1161-1174 (2018) - [j22]Francesco Pavese
:
Ovoids of H(3, q2), q odd, admitting a group of order (q+1)32. Discret. Math. 341(7): 2089-2094 (2018) - [j21]Sam Mattheus, Francesco Pavese
:
Triangle-free induced subgraphs of the unitary polarity graph. Eur. J. Comb. 72: 83-96 (2018) - [j20]Daniele Bartoli
, Francesco Pavese
:
Blocking semiovals in PG(2, q2), q odd, admitting PGL(2, q) as an automorphism group. Finite Fields Their Appl. 54: 315-334 (2018) - [i2]Antonio Cossidente, Francesco Pavese, Leo Storme:
Optimal subspace codes in PG(4, q). CoRR abs/1802.09793 (2018) - 2017
- [j19]Antonio Cossidente, Francesco Pavese
:
Subspace Codes in PG(2N - 1, Q). Comb. 37(6): 1073-1095 (2017) - [j18]Antonio Cossidente, Francesco Pavese
:
Maximal Partial Spreads of Polar Spaces. Electron. J. Comb. 24(2): 2 (2017) - [j17]Antonio Cossidente, Francesco Pavese
:
Strongly regular graphs from classical generalized quadrangles. Des. Codes Cryptogr. 85(3): 457-470 (2017) - [j16]Antonio Cossidente, Giuseppe Marino
, Francesco Pavese
:
On maximal cliques of polar graphs. Finite Fields Their Appl. 47: 276-285 (2017) - 2016
- [j15]Daniele Bartoli
, Francesco Pavese
:
A note on equidistant subspace codes. Discret. Appl. Math. 198: 291-296 (2016) - [j14]Antonio Cossidente
, Francesco Pavese
:
On subspace codes. Des. Codes Cryptogr. 78(2): 527-531 (2016) - [j13]Antonio Cossidente
, Giuseppe Marino
, Francesco Pavese
:
Non-linear maximum rank distance codes. Des. Codes Cryptogr. 79(3): 597-609 (2016) - [j12]Antonio Cossidente, Francesco Pavese
:
Veronese subspace codes. Des. Codes Cryptogr. 81(3): 445-457 (2016) - [j11]Antonio Cossidente, Francesco Pavese
:
Hemisystems of Q(6, q), q odd. J. Comb. Theory A 140: 112-122 (2016) - 2015
- [j10]Antonio Cossidente
, Francesco Pavese
:
Sets of even type on H(5, q2), q even. Discret. Appl. Math. 181: 280-282 (2015) - [j9]Antonio Cossidente
, Francesco Pavese
:
Blocking sets of Hermitian generalized quadrangles. Discret. Math. 338(1): 43-46 (2015) - [j8]Francesco Pavese
:
Geometric constructions of two-character sets. Discret. Math. 338(3): 202-208 (2015) - [j7]Antonio Cossidente
, Francesco Pavese
:
On the geometry of unitary involutions. Finite Fields Their Appl. 36: 14-28 (2015) - 2014
- [j6]Antonio Cossidente
, Francesco Pavese
:
New infinite families of hyperovals on $$\mathcal H (3, q^2), q$$ H ( 3 , q 2 ) , q odd. Des. Codes Cryptogr. 73(1): 217-222 (2014) - [j5]Antonio Cossidente
, Francesco Pavese
:
Hyperoval constructions on the Hermitian surface. Finite Fields Their Appl. 25: 19-25 (2014) - [j4]Antonio Cossidente
, Francesco Pavese
:
On (0, α)-sets of generalized quadrangles. Finite Fields Their Appl. 30: 139-152 (2014) - [j3]Antonio Cossidente
, Francesco Pavese
:
Intriguing sets of W(5, q), q even. J. Comb. Theory A 127: 303-313 (2014) - [i1]Antonio Cossidente, Francesco Pavese:
Subspace codes in PG(2n-1, q). CoRR abs/1411.3601 (2014) - 2013
- [j2]Francesco Pavese
:
Hyperovals on H(3, q2)H(3, q2) left invariant by a group of order 6(q+1)36(q+1)3. Discret. Math. 313(14): 1543-1546 (2013) - [j1]Francesco Pavese
, Antonio Cossidente:
New infinite families of hyperovals on H(3, q2), q odd. Electron. Notes Discret. Math. 40: 305-309 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-09 22:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint