Stefano Marcugini

According to our database1, Stefano Marcugini authored at least 81 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes.
IEEE Trans. Inf. Theory, 2020

Resolving sets for higher dimensional projective spaces.
Finite Fields Their Appl., 2020

On planes through points off the twisted cubic in PG(3, <i>q</i>) and multiple covering codes.
Finite Fields Their Appl., 2020

On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4.
CoRR, 2020

On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3.
CoRR, 2020

Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces.
Des. Codes Cryptogr., 2019

New bounds for linear codes of covering radii 2 and 3.
Cryptogr. Commun., 2019

2018
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, <i>q</i>) and Extendability of Reed-Solomon Codes.
Probl. Inf. Transm., 2018

A family of semifields in odd characteristic.
Des. Codes Cryptogr., 2018

2017
A combinatorial construction of an M<sub>12</sub>-invariant code.
Electron. Notes Discret. Math., 2017

Completeness of the 95256-cap in PG(12, 4).
Electron. Notes Discret. Math., 2017

Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q).
Electron. Notes Discret. Math., 2017

Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3.
Electron. Notes Discret. Math., 2017

The Pace code, the Mathieu group M<sub>12</sub> and the small Witt design S(5, 6, 12).
Discret. Math., 2017

On the completeness of plane cubic curves over finite fields.
Des. Codes Cryptogr., 2017

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5.
CoRR, 2017

Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture.
CoRR, 2017

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension.
CoRR, 2017

New Bounds for Linear Codes of Covering Radius 2.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
On the spectrum of sizes of semiovals contained in the Hermitian curve.
Eur. J. Comb., 2016

On constructions and parameters of symmetric configurations v<sub>k</sub>.
Des. Codes Cryptogr., 2016

Further results on multiple coverings of the farthest-off points.
Adv. Math. Commun., 2016

2015
The nonexistence of an additive quaternary [15, 5, 9]-code.
Finite Fields Their Appl., 2015

Multiple coverings of the farthest-off points with small density from projective geometry.
Adv. Math. Commun., 2015

2014
Upper bounds on the smallest size of a complete arc in <i>PG</i>(2, <i>q</i>) under a certain probabilistic conjecture.
Probl. Inf. Transm., 2014

The structure of quaternary quantum caps.
Des. Codes Cryptogr., 2014

The non-existence of some NMDS codes and the extremal sizes of complete (n, 3)-arcs in PG(2, 16).
Des. Codes Cryptogr., 2014

2-semiarcs in PG(2, q), q <sup>2</sup> 13.
Ars Comb., 2014

2013
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes.
Graphs Comb., 2013

A note on multiple coverings of the farthest-off points.
Electron. Notes Discret. Math., 2013

Classification of the smallest minimal 1-saturating sets in <i>PG</i>(2, <i>q</i>), <i>q</i>≤23.
Electron. Notes Discret. Math., 2013

A new algorithm and a new type of estimate for the smallest size of complete arcs in <i>P</i><i>G</i>(2, <i>q</i>)PG(2, q).
Electron. Notes Discret. Math., 2013

Transitive A 6-invariant k-arcs in PG(2, q).
Des. Codes Cryptogr., 2013

A Reason Maintenace System Dealing with Vague Data
CoRR, 2013

Tables of parameters of symmetric configurations $v_{k}$.
CoRR, 2013

A 3-cycle construction of complete arcs sharing (q+3)/2 points with a conic.
Adv. Math. Commun., 2013

2012
On sizes of complete arcs in PG(2, q).
Discret. Math., 2012

2011
The Nonexistence of a [[13, 5, 4]]-Quantum Stabilizer Code.
IEEE Trans. Inf. Theory, 2011

Upper bounds on the smallest size of a complete arc in the plane PG(2,q)
CoRR, 2011

Linear nonbinary covering codes and saturating sets in projective spaces.
Adv. Math. Commun., 2011

The minimum order of complete caps in PG(4, 4).
Adv. Math. Commun., 2011

2010
A geometric non-existence proof of an extremal additive code.
J. Comb. Theory, Ser. A, 2010

On the spectrum of the sizes of semiovals in PG(2, q), q odd.
Discret. Math., 2010

On sizes of complete arcs in PG(2,q)
CoRR, 2010

2009
Short Additive Quaternary Codes.
IEEE Trans. Inf. Theory, 2009

Complete ( <i>q</i> <sup>2</sup> + <i>q</i> + 8)/2-caps in the spaces <i>PG</i> (3, <i>q</i> ), <i>q</i> = 2 (mod 3) an odd prime, and a complete 20-cap in <i>PG</i> (3, 5).
Des. Codes Cryptogr., 2009

The non-existence of a [[13,5,4]] quantum stabilizer code
CoRR, 2009

2008
Constructions of small complete arcs with prescribed symmetry.
Contributions Discret. Math., 2008

On the non-existence of a maximal partial spread of size 76 in PG(3, 9).
Ars Comb., 2008

2007
Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs.
Discret. Math., 2007

2006
Minimal 1-saturating sets and complete caps in binary projective spaces.
J. Comb. Theory, Ser. A, 2006

The smallest size of a complete cap in PG(3, 7).
Discret. Math., 2006

Classification of linear codes exploiting an invariant.
Contributions Discret. Math., 2006

An Architecture for Dynamical News Providers.
Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006

2005
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.
IEEE Trans. Inf. Theory, 2005

A family of highly symmetric codes.
IEEE Trans. Inf. Theory, 2005

Maximal (<i>n</i>, 3)-arcs in PG(2, 13).
Discret. Math., 2005

An Architecture for Evolutionary Adaptive Web Systems.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Evolutionary online services.
Proceedings of the 7th International Conference on Electronic Commerce, 2005

2004
Linear codes with covering radius 2, 3 and saturating sets in projective geometry.
IEEE Trans. Inf. Theory, 2004

2003
On saturating sets in projective spaces.
J. Comb. Theory, Ser. A, 2003

Projective Planes, Coverings and a Network Problem.
Des. Codes Cryptogr., 2003

Minimal 1-saturating sets in PG(2, q), q≤16.
Australas. J Comb., 2003

2002
NMDS Codes of maximal length over F<sub>q</sub>, 8 <= q <= 11.
IEEE Trans. Inf. Theory, 2002

The Cyclic Model for PG(n,q) and a Construction of Arcs.
Eur. J. Comb., 2002

2001
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).
Ars Comb., 2001

2000
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999
Stockbot: a monitoring and acting software agent for stock markets.
Intell. Syst. Account. Finance Manag., 1999

Maximal (n, 3)-arcs in PG(2, 11).
Discret. Math., 1999

1998
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5.
Ars Comb., 1998

Encoding Planning Constraints into Partial Order Planners.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

An Extension of SATPLAN for Planning with Constraints.
Proceedings of the Artificial Intelligence: Methodology, 1998

1997
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.
Ars Comb., 1997

Task Planning and Partial Order Planning: A Domain Transformation Approach.
Proceedings of the Recent Advances in AI Planning, 4th European Conference on Planning, 1997

Compiling Task Networks into Partial Order Planning Domains.
Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

1996
Encapsulation of Actions and Plans in Conditional Planning Systems.
Proceedings of the Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 1996

1995
A Weakest Precondition Semantics for Conditional Planning.
Proceedings of the Topics in Artificial Intelligence, 1995

1992
Plans as Planning Objects.
Proceedings of the Artificial Intelligence V: Methodology, Systems, Applications, 1992

1991
A Reason Maintenance System Dealing with Vague Data.
Proceedings of the UAI '91: Proceedings of the Seventh Annual Conference on Uncertainty in Artificial Intelligence, 1991

Truth Maintenance in Approximate Reasoning.
Proceedings of the Trends in Artificial Intelligence, 1991


  Loading...