Stefano Marcugini

Adv. Math. Commun., 2025

2024

An asymptotic property of quaternary additive codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., November, 2024

Further results on covering codes with radius R and codimension tR+1.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., September, 2024

2023

On the weight distribution of the cosets of MDS codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

2021

On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Optimal Additive Quaternary Codes of Low Dimension.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Twisted cubic and point-line incidence matrix in $\mathrm {PG}(3, q)$.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

Upper bounds on the length function for covering codes.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Resolving sets for higher dimensional projective spaces.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2020

On planes through points off the twisted cubic in PG(3, q) and multiple covering codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

On resolving sets in the point-line incidence graph of PG(n, q).

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

New bounds for linear codes of covering radii 2 and 3.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces.

[BibT_eX]

[DOI]

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

2018

On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2018

A family of semifields in odd characteristic.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

2017

A combinatorial construction of an M12-invariant code.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Completeness of the 95256-cap in PG(12, 4).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

The Pace code, the Mathieu group M12 and the small Witt design S(5, 6, 12).

[BibT_eX]

[DOI]

Discret. Math., 2017

On the completeness of plane cubic curves over finite fields.

[BibT_eX]

[DOI]

Daniele Bartoli

Des. Codes Cryptogr., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

New Bounds for Linear Codes of Covering Radius 2.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

On constructions and parameters of symmetric configurations vk.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Further results on multiple coverings of the farthest-off points.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2016

2015

The nonexistence of an additive quaternary [15, 5, 9]-code.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Multiple coverings of the farthest-off points with small density from projective geometry.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture.

[BibT_eX]

[DOI]

Daniele Bartoli

Aleksei Andreevich Kreshchuk

Giorgio Faina

Probl. Inf. Transm., 2014

The structure of quaternary quantum caps.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

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

[BibT_eX]

[DOI]

Daniele Bartoli

Des. Codes Cryptogr., 2014

2-semiarcs in PG(2, q), q 2 13.

[BibT_eX]

Ars Comb., 2014

2013

Some Combinatorial Aspects of Constructing Bipartite-Graph Codes.

[BibT_eX]

[DOI]

Graphs Comb., 2013

A note on multiple coverings of the farthest-off points.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Classification of the smallest minimal 1-saturating sets in PG(2, q), q≤23.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A new algorithm and a new type of estimate for the smallest size of complete arcs in PG(2, q)PG(2, q).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Transitive A 6-invariant k-arcs in PG(2, q).

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

A Reason Maintenace System Dealing with Vague Data

[BibT_eX]

[DOI]

CoRR, 2013

Tables of parameters of symmetric configurations $v_{k}$.

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

Adv. Math. Commun., 2013

2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

The Nonexistence of a [[13, 5, 4]]-Quantum Stabilizer Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Linear nonbinary covering codes and saturating sets in projective spaces.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

The minimum order of complete caps in PG(4, 4).

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

2010

A geometric non-existence proof of an extremal additive code.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2010

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

[BibT_eX]

[DOI]

György Kiss

Discret. Math., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

2009

Short Additive Quaternary Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

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).

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

2008

Constructions of small complete arcs with prescribed symmetry.

[BibT_eX]

[DOI]

Petr Lisonek

Contributions Discret. Math., 2008

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

[BibT_eX]

Ars Comb., 2008

2007

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

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Minimal 1-saturating sets and complete caps in binary projective spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

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

[BibT_eX]

[DOI]

Discret. Math., 2006

Classification of linear codes exploiting an invariant.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2006

An Architecture for Dynamical News Providers.

[BibT_eX]

[DOI]

Emanuela Falcinelli

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

A family of highly symmetric codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Maximal (n, 3)-arcs in PG(2, 13).

[BibT_eX]

[DOI]

Discret. Math., 2005

An Architecture for Evolutionary Adaptive Web Systems.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Evolutionary online services.

[BibT_eX]

[DOI]

Silvia Suriani

Proceedings of the 7th International Conference on Electronic Commerce, 2005

2004

Linear codes with covering radius 2, 3 and saturating sets in projective geometry.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

2003

On saturating sets in projective spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Projective Planes, Coverings and a Network Problem.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Minimal 1-saturating sets in PG(2, q), q≤16.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

NMDS Codes of maximal length over Fq, 8 <= q <= 11.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

2001

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

[BibT_eX]

Ars Comb., 2001

2000

DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999

Stockbot: a monitoring and acting software agent for stock markets.

[BibT_eX]

[DOI]

Intell. Syst. Account. Finance Manag., 1999

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

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

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

[BibT_eX]

Ars Comb., 1998

Encoding Planning Constraints into Partial Order Planners.

[BibT_eX]

Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

An Extension of SATPLAN for Planning with Constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Ars Comb., 1997

Task Planning and Partial Order Planning: A Domain Transformation Approach.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in AI Planning, 4th European Conference on Planning, 1997

Compiling Task Networks into Partial Order Planning Domains.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

1996

Encapsulation of Actions and Plans in Conditional Planning Systems.

[BibT_eX]

Proceedings of the Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 1996

1995

A Weakest Precondition Semantics for Conditional Planning.

[BibT_eX]

[DOI]

Proceedings of the Topics in Artificial Intelligence, 1995

1992

Plans as Planning Objects.

[BibT_eX]