The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fernanda Pambianco: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  2. 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. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  3. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
    Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  4. Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco
    Projective Planes, Coverings and a Network Problem. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:71-89 [Journal]
  5. Alexander A. Davydov, Giorgio Faina, Fernanda Pambianco
    Constructions of Small Complete Caps in Binary Projective Spaces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:61-80 [Journal]
  6. Massimo Giulietti, Fernanda Pambianco, Fernando Torres, Emanuela Ughi
    On Complete Arcs Arising from Plane Curves. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:25, n:3, pp:237-246 [Journal]
  7. Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco
    The smallest size of a complete cap in PG(3, 7). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1257-1263 [Journal]
  8. Massimo Giulietti, Fernanda Pambianco, Fernando Torres, Emanuela Ughi
    On large complete arcs: odd case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:255, n:1-3, pp:145-159 [Journal]
  9. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
    Maximal (n, 3)-arcs in PG(2, 13). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:139-145 [Journal]
  10. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
    Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:739-747 [Journal]
  11. Giorgio Faina, György Kiss, Stefano Marcugini, Fernanda Pambianco
    The Cyclic Model for PG(n,q) and a Construction of Arcs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:1, pp:31-35 [Journal]
  12. Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
    On saturating sets in projective spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:103, n:1, pp:1-15 [Journal]
  13. Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
    Minimal 1-saturating sets and complete caps in binary projective spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:4, pp:647-663 [Journal]
  14. Fernanda Pambianco, Leo Storme
    Small Complete Caps in Spaces of Even Characteristic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:1, pp:70-84 [Journal]
  15. Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco
    A family of highly symmetric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3665-3668 [Journal]
  16. Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
    Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4378-4387 [Journal]
  17. Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
    Linear codes with covering radius 2, 3 and saturating sets in projective geometry. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:537-541 [Journal]
  18. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
    NMDS Codes of maximal length over Fq, 8 <= q <= 11. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:963-966 [Journal]
  19. Giorgio Faina, Fernanda Pambianco
    On some 10-arcs for deriving the minimum order for complete arcs in small projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:261-271 [Journal]
  20. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
    Maximal (n, 3)-arcs in PG(2, 11). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:421-426 [Journal]
  21. Fernanda Pambianco
    A class of complete k-caps of small cardinality in projective spaces over fields of characteristic three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:463-468 [Journal]
  22. Giorgio Faina, Fernanda Pambianco
    Small complete caps in PG(r, q), r >= 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:174, n:1-3, pp:117-123 [Journal]

  23. On the non-existence of a maximal partial spread of size 76 in PG(3, 9). [Citation Graph (, )][DBLP]


  24. Minimal blocking sets in PG(2, 9). [Citation Graph (, )][DBLP]


  25. The non-existence of a [[13,5,4]] quantum stabilizer code [Citation Graph (, )][DBLP]


  26. Some combinatorial aspects of constructing bipartite-graph codes [Citation Graph (, )][DBLP]


  27. 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). [Citation Graph (, )][DBLP]


  28. On the spectrum of the sizes of semiovals in PG(2, q), q odd. [Citation Graph (, )][DBLP]


Search in 0.129secs, Finished in 0.131secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002