Small complete caps in PG(r, q), r >= 3

@article{Faina1997SmallCC,
  title={Small complete caps in PG(r, q), r >= 3},
  author={Giorgio Faina and Fernanda Pambianco},
  journal={Discrete Mathematics},
  year={1997},
  volume={174},
  pages={117-123}
}
A very difficult problem for complete caps in PG(r,q) is to determine their minimum size. The results on this topic are still scarce and in this paper we survey the best results now known. Furthermore, we construct new interesting sporadic examples of complete caps in PG(3, q) and in PG(4, q) such that their size are smaller than the currently known. As a consequence, we get that the Pellegrino's conjecture on the minimal size of a complete k-cap in PG(3,q), q odd, is in general false. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
1 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Codes with covering radius 2 and other new covering codes

  • L. M. Tombak
  • 1991

Similar Papers

Loading similar papers…