default search action
Stefano Marcugini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j64]Alexander A. Davydov
, Stefano Marcugini
Further results on covering codes with radius R and codimension tR+1. Des. Codes Cryptogr. 92(9): 2527-2548 (2024) - [j63]Jürgen Bierbrauer, Stefano Marcugini
An asymptotic property of quaternary additive codes. Des. Codes Cryptogr. 92(11): 3371-3375 (2024) - 2023
- [j62]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $. Adv. Math. Commun. 17(1): 98-118 (2023) - [j61]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the weight distribution of the cosets of MDS codes. Adv. Math. Commun. 17(5): 1115-1138 (2023) - [i14]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
New bounds for covering codes of radius 3 and codimension 3t+1. CoRR abs/2305.11955 (2023) - 2021
- [j60]Alexander A. Davydov
Twisted cubic and point-line incidence matrix in $\mathrm {PG}(3, q)$. Des. Codes Cryptogr. 89(10): 2211-2233 (2021) - [j59]Alexander A. Davydov
On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4. IEEE Trans. Inf. Theory 67(8): 5088-5096 (2021) - [j58]Jürgen Bierbrauer, Stefano Marcugini
Optimal Additive Quaternary Codes of Low Dimension. IEEE Trans. Inf. Theory 67(8): 5116-5118 (2021) - [i13]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the weight distribution of the cosets of MDS codes. CoRR abs/2101.12722 (2021) - [i12]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the length function for covering codes. CoRR abs/2108.13609 (2021) - 2020
- [j57]Daniele Bartoli, György Kiss, Stefano Marcugini, Fernanda Pambianco:
On resolving sets in the point-line incidence graph of PG(n, q). Ars Math. Contemp. 19(2): 231-247 (2020) - [j56]Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On planes through points off the twisted cubic in PG(3, q) and multiple covering codes. Finite Fields Their Appl. 67: 101710 (2020) - [j55]Daniele Bartoli, György Kiss, Stefano Marcugini, Fernanda Pambianco:
Resolving sets for higher dimensional projective spaces. Finite Fields Their Appl. 67: 101723 (2020) - [j54]Jürgen Bierbrauer, Stefano Marcugini
Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes. IEEE Trans. Inf. Theory 66(1): 273-277 (2020) - [c16]Alexander A. Davydov
Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture. ICCSA (1) 2020: 107-122 - [i11]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3. CoRR abs/2007.02405 (2020) - [i10]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4. CoRR abs/2007.08798 (2020)
2010 – 2019
- 2019
- [j53]Daniele Bartoli, Alexander A. Davydov
New bounds for linear codes of covering radii 2 and 3. Cryptogr. Commun. 11(5): 903-920 (2019) - [j52]Alexander A. Davydov
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces. Des. Codes Cryptogr. 87(12): 2771-2792 (2019) - [c15]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces. REDUNDANCY 2019: 52-57 - 2018
- [j51]Jürgen Bierbrauer, Daniele Bartoli
A family of semifields in odd characteristic. Des. Codes Cryptogr. 86(3): 611-621 (2018) - [j50]Daniele Bartoli
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes. Probl. Inf. Transm. 54(2): 101-115 (2018) - 2017
- [j49]Daniele Bartoli
On the completeness of plane cubic curves over finite fields. Des. Codes Cryptogr. 83(2): 233-267 (2017) - [j48]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
The Pace code, the Mathieu group M12 and the small Witt design S(5, 6, 12). Discret. Math. 340(6): 1187-1190 (2017) - [j47]Daniele Bartoli, Alexander A. Davydov
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) - [j46]Daniele Bartoli
Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q). Electron. Notes Discret. Math. 57: 21-26 (2017) - [j45]Daniele Bartoli
Completeness of the 95256-cap in PG(12, 4). Electron. Notes Discret. Math. 57: 27-32 (2017) - [j44]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
A combinatorial construction of an M12-invariant code. Electron. Notes Discret. Math. 57: 61-66 (2017) - [c14]Daniele Bartoli
New Bounds for Linear Codes of Covering Radius 2. ICMCTA 2017: 1-10 - [i9]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) - [i8]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) - [i7]Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5. CoRR abs/1712.07078 (2017) - 2016
- [j43]Daniele Bartoli
Further results on multiple coverings of the farthest-off points. Adv. Math. Commun. 10(3): 613-632 (2016) - [j42]Alexander A. Davydov
On constructions and parameters of symmetric configurations vk. Des. Codes Cryptogr. 80(1): 125-147 (2016) - [j41]Daniele Bartoli
On the spectrum of sizes of semiovals contained in the Hermitian curve. Eur. J. Comb. 52: 223-233 (2016) - 2015
- [j40]Daniele Bartoli
Multiple coverings of the farthest-off points with small density from projective geometry. Adv. Math. Commun. 9(1): 63-85 (2015) - [j39]Jürgen Bierbrauer, Daniele Bartoli
The nonexistence of an additive quaternary [15, 5, 9]-code. Finite Fields Their Appl. 36: 29-40 (2015) - 2014
- [j38]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) - [j37]Daniele Bartoli
The non-existence of some NMDS codes and the extremal sizes of complete (n, 3)-arcs in PG(2, 16). Des. Codes Cryptogr. 72(1): 129-134 (2014) - [j36]Jürgen Bierbrauer, Daniele Bartoli
The structure of quaternary quantum caps. Des. Codes Cryptogr. 72(3): 733-747 (2014) - [j35]Daniele Bartoli
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
- [j34]Daniele Bartoli
A 3-cycle construction of complete arcs sharing (q+3)/2 points with a conic. Adv. Math. Commun. 7(3): 319-334 (2013) - [j33]Massimo Giulietti
Transitive A 6-invariant k-arcs in PG(2, q). Des. Codes Cryptogr. 68(1-3): 73-79 (2013) - [j32]Daniele Bartoli
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) - [j31]Fernanda Pambianco, Daniele Bartoli
Classification of the smallest minimal 1-saturating sets in PG(2, q), q≤23. Electron. Notes Discret. Math. 40: 229-233 (2013) - [j30]Fernanda Pambianco, Alexander A. Davydov
A note on multiple coverings of the farthest-off points. Electron. Notes Discret. Math. 40: 289-293 (2013) - [j29]Alexander A. Davydov
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes. Graphs Comb. 29(2): 187-212 (2013) - [i6]Bruno Fringuelli, Stefano Marcugini, Alfredo Milani, Silvano Rivoira:
A Reason Maintenace System Dealing with Vague Data. CoRR abs/1303.5717 (2013) - [i5]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
- [j28]Daniele Bartoli
On sizes of complete arcs in PG(2, q). Discret. Math. 312(3): 680-698 (2012) - 2011
- [j27]Daniele Bartoli
The minimum order of complete caps in PG(4, 4). Adv. Math. Commun. 5(1): 37-40 (2011) - [j26]Alexander A. Davydov
Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5(1): 119-147 (2011) - [j25]Jürgen Bierbrauer, Richard Fears, Stefano Marcugini, Fernanda Pambianco:
The Nonexistence of a [[13, 5, 4]]-Quantum Stabilizer Code. IEEE Trans. Inf. Theory 57(7): 4788-4793 (2011) - [i4]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
- [j24]György Kiss, Stefano Marcugini, Fernanda Pambianco:
On the spectrum of the sizes of semiovals in PG(2, q), q odd. Discret. Math. 310(22): 3188-3193 (2010) - [j23]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
A geometric non-existence proof of an extremal additive code. J. Comb. Theory A 117(2): 128-137 (2010) - [i3]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
- [j22]Alexander A. Davydov
Complete ( q 2 + q + 8)/2-caps in the spaces PG (3, q ), q = 2 (mod 3) an odd prime, and a complete 20-cap in PG (3, 5). Des. Codes Cryptogr. 50(3): 359-372 (2009) - [j21]Jürgen Bierbrauer, Yves Edel, Giorgio Faina
Short Additive Quaternary Codes. IEEE Trans. Inf. Theory 55(3): 952-954 (2009) - [i2]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
The non-existence of a [[13,5,4]] quantum stabilizer code. CoRR abs/0908.1348 (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
- [j20]Olof Heden, Stefano Marcugini, Fernanda Pambianco, Leo Storme:
On the non-existence of a maximal partial spread of size 76 in PG(3, 9). Ars Comb. 89 (2008) - [j19]Petr Lisonek, Stefano Marcugini, Fernanda Pambianco:
Constructions of small complete arcs with prescribed symmetry. Contributions Discret. Math. 3(1) (2008) - 2007
- [j18]Stefano Marcugini, Alfredo Milani
Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. Discret. Math. 307(6): 739-747 (2007) - 2006
- [j17]Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
Classification of linear codes exploiting an invariant. Contributions Discret. Math. 1(1) (2006) - [j16]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
The smallest size of a complete cap in PG(3, 7). Discret. Math. 306(13): 1257-1263 (2006) - [j15]Alexander A. Davydov
Minimal 1-saturating sets and complete caps in binary projective spaces. J. Comb. Theory A 113(4): 647-663 (2006) - [c13]Emanuela Falcinelli, Stefano Marcugini, Alfredo Milani
An Architecture for Dynamical News Providers. IAT Workshops 2006: 200-203 - 2005
- [j14]Stefano Marcugini, Alfredo Milani
Maximal (n, 3)-arcs in PG(2, 13). Discret. Math. 294(1-2): 139-145 (2005) - [j13]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
A family of highly symmetric codes. IEEE Trans. Inf. Theory 51(10): 3665-3668 (2005) - [j12]Alexander A. Davydov
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Trans. Inf. Theory 51(12): 4378-4387 (2005) - [c12]Alfredo Milani
Evolutionary online services. ICEC 2005: 343-349 - [c11]Alfredo Milani
An Architecture for Evolutionary Adaptive Web Systems. WINE 2005: 444-454 - 2004
- [j11]Alexander A. Davydov
Linear codes with covering radius 2, 3 and saturating sets in projective geometry. IEEE Trans. Inf. Theory 50(3): 537-541 (2004) - 2003
- [j10]Stefano Marcugini, Fernanda Pambianco:
Minimal 1-saturating sets in PG(2, q), q≤16. Australas. J Comb. 28: 161-170 (2003) - [j9]Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
Projective Planes, Coverings and a Network Problem. Des. Codes Cryptogr. 29(1-3): 71-89 (2003) - [j8]Alexander A. Davydov
On saturating sets in projective spaces. J. Comb. Theory A 103(1): 1-15 (2003) - 2002
- [j7]Giorgio Faina
The Cyclic Model for PG(n,q) and a Construction of Arcs. Eur. J. Comb. 23(1): 31-35 (2002) - [j6]Stefano Marcugini, Alfredo Milani
NMDS Codes of maximal length over Fq, 8 <= q <= 11. IEEE Trans. Inf. Theory 48(4): 963-966 (2002) - 2001
- [j5]Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9). Ars Comb. 61 (2001) - 2000
- [c10]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph. AIPS 2000: 13-21
1990 – 1999
- 1999
- [j4]Stefano Marcugini, Alfredo Milani
Maximal (n, 3)-arcs in PG(2, 11). Discret. Math. 208-209: 421-426 (1999) - [j3]Alfredo Milani, Stefano Marcugini:
Stockbot: a monitoring and acting software agent for stock markets. Intell. Syst. Account. Finance Manag. 8(1): 3-14 (1999) - 1998
- [j2]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) - [c9]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
An Extension of SATPLAN for Planning with Constraints. AIMSA 1998: 39-49 - [c8]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
Encoding Planning Constraints into Partial Order Planners. KR 1998: 608-616 - 1997
- [j1]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) - [c7]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
Compiling Task Networks into Partial Order Planning Domains. AI*IA 1997: 311-321 - [c6]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
Task Planning and Partial Order Planning: A Domain Transformation Approach. ECP 1997: 52-63 - 1996
- [c5]Marco Baioletti, Stefano Marcugini, Alfredo Milani:
Encapsulation of Actions and Plans in Conditional Planning Systems. IEA/AIE 1996: 665-672 - 1995
- [c4]Marco Baioletti, Stefano Marcugini, Alfredo Milani
A Weakest Precondition Semantics for Conditional Planning. AI*IA 1995: 291-302 - 1992
- [c3]Stefano Marcugini, Alfredo Milani, Maurizio Terragnolo:
Plans as Planning Objects. AIMSA 1992: 35-44 - 1991
- [c2]Bruno Fringuelli, Stefano Marcugini, Alfredo Milani
Truth Maintenance in Approximate Reasoning. AI*IA 1991: 430-434 - [c1]Bruno Fringuelli, Stefano Marcugini, Alfredo Milani, Silvano Rivoira:
A Reason Maintenance System Dealing with Vague Data. UAI 1991: 111-117
Coauthor Index
[j64] [j63] [j62] [j61] [i14] [j60] [j59] [j58] [i13] [i12] [j57] [j56] [j55] [j54] [c16] [i11] [i10] [j53] [j52] [c15] [j51] [j50] [j49] [j48] [j47] [j46] [j45] [j44] [c14] [i9] [i8] [i7] [j43] [j42] [j41] [j40] [j39] [j38] [j37] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [j29] [i5] [j28] [j27] [j26] [j25] [i4] [j24] [j23] [i3] [j22] [j21] [i2] [i1] [j20] [j19] [j18] [j17] [j16] [j15] [j14] [j13] [j12] [j11] [j10] [j9] [j8] [j7] [j6] [j5] [j4] [j2] [j1]
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-10-23 20:35 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: