On saturating sets in projective spaces
- 23 May 2003
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 103 (1) , 1-15
- https://doi.org/10.1016/s0097-3165(03)00052-9
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Linear codes with covering radius R=2, 3 and codimension tRIEEE Transactions on Information Theory, 2001
- Computer search for small complete capsJournal of Geometry, 2000
- On Saturating Sets in Small Projective GeometriesEuropean Journal of Combinatorics, 2000
- Constructions and families of nonbinary linear codes with covering radius 2IEEE Transactions on Information Theory, 1999
- On the spectrum of the valuesk for which a completek- cap in PG(n, q) existsJournal of Geometry, 1998
- Small Complete Caps in Spaces of Even CharacteristicJournal of Combinatorial Theory, Series A, 1996
- Constructions and families of covering codes and saturated sets of points in projective geometryIEEE Transactions on Information Theory, 1995
- General Galois GeometriesBulletin of the London Mathematical Society, 1993
- Some Optimal Codes from Algebraic Geometry and Their Covering RadiiEuropean Journal of Combinatorics, 1990
- Saturated Configurations of Points in Projective Galois SpacesEuropean Journal of Combinatorics, 1987