Minimal 1-saturating sets and complete caps in binary projective spaces
- 31 May 2006
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 113 (4) , 647-663
- https://doi.org/10.1016/j.jcta.2005.06.003
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Constructions of Small Complete Caps in Binary Projective SpacesDesigns, Codes and Cryptography, 2005
- Complete caps in projective spaces PG (n, q)Journal of Geometry, 2004
- On saturating sets in projective spacesJournal of Combinatorial Theory, Series A, 2003
- New Codes from Old; A New Geometric ConstructionJournal of Combinatorial Theory, Series A, 2001
- On Saturating Sets in Small Projective GeometriesEuropean Journal of Combinatorics, 2000
- Long Binary Linear Codes and Large Caps in Projective SpaceDesigns, Codes and Cryptography, 1999
- On the spectrum of the valuesk for which a completek- cap in PG(n, q) existsJournal of Geometry, 1998
- Linear codes with covering radius 2 and other new covering codesIEEE Transactions on Information Theory, 1991
- Short codes with a given covering radiusIEEE Transactions on Information Theory, 1989
- On the covering radius of codesIEEE Transactions on Information Theory, 1985