EDBT 2026 Demo / reviewers in the wild / expert
Antonio Cossidente
dblp:93/3812
· DBLP profile ↗
27ranked-venue papers
22as first author
1since 2021 · last 2023
0000-0001-5264-2353ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 24 · 19 first-author · 1 since 2021Theory of computation · 3 · 3 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Coding theory · 51% Combinatorics and discrete mathematics · 27% Computational geometry · 22% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
error-correcting codes |
0.1 | 2 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 A geometric construction of an optimal [67, 9, 30] binary code · IEEE Trans. Inf. Theory 2001 |
Combinatorics and discrete mathematics
finite geometry |
0.1 | 2 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 A geometric construction of an optimal [67, 9, 30] binary code · IEEE Trans. Inf. Theory 2001 |
Computational geometry
geometric construction |
0.1 | 2 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 A geometric construction of an optimal [67, 9, 30] binary code · IEEE Trans. Inf. Theory 2001 |
Coding theory › error-correcting codes › block codes
linear code |
0.1 | 1 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 |
Coding theory › error-correcting codes › optimal codes
optimal binary codes |
0.0 | 1 | 2001 | A geometric construction of an optimal [67, 9, 30] binary code · IEEE Trans. Inf. Theory 2001 |
Coding theory › error-correcting codes › block codes › linear code
automorphism group |
0.0 | 1 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 |
Combinatorics and discrete mathematics
group theory |
0.0 | 1 | 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11 · IEEE Trans. Inf. Theory 2008 |
Coding theory › error-correcting codes › q-ary codes
ternary codes |
0.0 | 1 | 2001 | A geometric construction of an optimal [67, 9, 30] binary code · IEEE Trans. Inf. Theory 2001 |
Methods — techniques the papers use, named apart from their topics
gluing construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | On near-MDS codes and caps
Michela Ceria, Antonio Cossidente, Giuseppe Marino 0002, Francesco Pavese |
Des. Codes Cryptogr. | 2 |
| 2019 | On line covers of finite projective and polar spaces
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2018 | On intriguing sets of finite symplectic spaces
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2017 | Strongly regular graphs from classical generalized quadrangles
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2016 | Non-linear maximum rank distance codes
Antonio Cossidente, Giuseppe Marino 0002, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2016 | On subspace codes
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2016 | Veronese subspace codes
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2015 | Sets of even type on H(5, q2), q even
Antonio Cossidente, Francesco Pavese |
Discret. Appl. Math. | 1 |
| 2015 | A new family of relative hemisystems on the Hermitian surface
Antonio Cossidente |
Des. Codes Cryptogr. | 1 |
| 2014 | Relative symplectic subquadrangle hemisystems of the Hermitian surface
Antonio Cossidente, Giuseppe Marino 0002, Tim Penttila |
Des. Codes Cryptogr. | 1 |
| 2014 | New infinite families of hyperovals on $$\mathcal H (3, q^2), q$$ H ( 3 , q 2 ) , q odd
Antonio Cossidente, Francesco Pavese |
Des. Codes Cryptogr. | 1 |
| 2012 | Hyperovals of Hermitian polar spaces
Antonio Cossidente, Giuseppe Marino 0002 |
Des. Codes Cryptogr. | 1 |
| 2010 | The classical 1-system of Q-(7, q) and two-character sets
Antonio Cossidente |
Des. Codes Cryptogr. | 1 |
| 2010 | Some two-character sets
Antonio Cossidente, Oliver H. King |
Des. Codes Cryptogr. | 1 |
| 2009 | Some constructions on the Hermitian surface
Antonio Cossidente |
Des. Codes Cryptogr. | 1 |
| 2008 | The geometry of some two-character sets
Antonio Cossidente, Nicola Durante, Giuseppe Marino 0002, Tim Penttila, Alessandro Siciliano |
Des. Codes Cryptogr. | 1 |
| 2008 | On the geometry of the exceptional group G 2( q ), q even
Antonio Cossidente, Oliver H. King |
Des. Codes Cryptogr. | 1 |
| 2008 | A Geometric Construction of a [110, 5, 90]9 -Linear Code Admitting the Mathieu Group M11abstractWe give a geometric construction of a$[110,5,90]_{9}$-linear code admitting the Mathieu group$M_{11}$as a subgroup of its automorphism group. Antonio Cossidente, Angelo Sonnino |
IEEE Trans. Inf. Theory | 1 |
| 2007 | Veronese embedding and two-character sets
Antonio Cossidente, Giuseppe Marino 0002 |
Des. Codes Cryptogr. | 1 |
| 2006 | The Automorphism Group of Plane Algebraic Curves with Singer Automorphisms
Antonio Cossidente, Alessandro Siciliano |
Des. Codes Cryptogr. | 1 |
| 2004 | Remarks on Singer Cyclic Groups and Their Normalizers
Antonio Cossidente, Marialuisa J. de Resmini |
Des. Codes Cryptogr. | 1 |
| 2003 | Complete Spans on Hermitian Varieties
Angela Aguglia, Antonio Cossidente, Gary L. Ebert |
Des. Codes Cryptogr. | 2 |
| 2002 | Hermitian Veronesean Schemes
Edoardo Ballico, Antonio Cossidente |
Des. Codes Cryptogr. | 2 |
| 2001 | Curves in Projective Spaces and Almost MDS Codes
Edoardo Ballico, Antonio Cossidente |
Des. Codes Cryptogr. | 2 |
| 2001 | Veronese Varieties Over Finite Fields and Their Projections
Antonio Cossidente, Domenico Labbate, Alessandro Siciliano |
Des. Codes Cryptogr. | 1 |
| 2001 | A geometric construction of an optimal [67, 9, 30] binary codeabstractWe construct a new optimal binary [67,9,30]-code corresponding to a complete cap of PG(8,2). This cap is obtained by gluing together some Hermitian Veroneseans in a mixed partition of PG(8,2) and one hyperoval. We also construct a ternary [364,9,234]-code corresponding to a complete cap of PG(8,3). This cap turns out to be as large as the largest known cap in PG(8,3) (in an asymptotical sense). Antonio Cossidente, Alessandro Siciliano |
IEEE Trans. Inf. Theory | 1 |
| 2000 | Mixed Partitions of Projective Geometries
Arrigo Bonisoli, Antonio Cossidente |
Des. Codes Cryptogr. | 2 |