Fernanda Pambianco
Orcid: 0000-0001-5476-5365
According to our database1,
Fernanda Pambianco
authored at least 86 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Des. Codes Cryptogr., November, 2024
Des. Codes Cryptogr., September, 2024
2023
Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $.
Adv. Math. Commun., 2023
2021
On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4.
IEEE Trans. Inf. Theory, 2021
Des. Codes Cryptogr., 2021
2020
IEEE Trans. Inf. Theory, 2020
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
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.
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 radius 3 and 2-saturating sets in projective spaces.
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, <i>q</i>) and Extendability of Reed-Solomon Codes.
Probl. Inf. Transm., 2018
2017
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
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
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
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017
2016
Eur. J. Comb., 2016
Des. Codes Cryptogr., 2016
Adv. Math. Commun., 2016
2015
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 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
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
Adv. Math. Commun., 2013
2012
2011
IEEE Trans. Inf. Theory, 2011
Adv. Math. Commun., 2011
2010
J. Comb. Theory A, 2010
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
2008
Contributions Discret. Math., 2008
Minimal blocking sets in PG(2, 9).
Ars Comb., 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
J. Comb. Theory A, 2006
Contributions Discret. Math., 2006
2005
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.
IEEE Trans. Inf. Theory, 2005
Des. Codes Cryptogr., 2005
2004
IEEE Trans. Inf. Theory, 2004
2003
2002
IEEE Trans. Inf. Theory, 2002
On Complete Arcs Arising from Plane Curves.
Des. Codes Cryptogr., 2002
2001
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).
Ars Comb., 2001
2000
A class of k-caps having k-2 points in common with an elliptic quadric and two points on an external line.
Australas. J Comb., 2000
1999
A class of complete k-caps of small cardinality in projective spaces over fields of characteristic three.
Discret. Math., 1999
On some 10-arcs for deriving the minimum order for complete arcs in small projective planes.
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
1997
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.
Ars Comb., 1997
1996