Computer search for small complete caps

Journal of Geometry

Volumn 69, Issue 1-2, 2000, Pages 172-179

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4244008535     PISSN: 00472468     EISSN: 14208997     Source Type: Journal    
DOI: 10.1007/bf01237484     Document Type: Article

References (10)

1. E. AARTS AND J. K. LENSTRA (Eds.), "Local Search in Combinatorial Optimization," Wiley, New York, 1997.
2. A. A. DAVYDOV AND P. R. J. ÖSTERGÅRD, Recursive constructions of complete caps, submitted for publication.
3. G. DUECK, New optimization heuristics: The great deluge algorithm and record-to-record travel, J. Comput. Phys. 104 (1993), 86-92.
4. G. FAINA AND F. PAMBIANCO, On the spectrum of the values k for which a complete k-cap in PG(n, q) exists, J. Geom. 62 (1998), 84-98.
5. J. W. P. HIRSCHFELD, "Finite Projective Spaces of Three Dimensions," Oxford University Press, Oxford, 1985.
6. J. W. P. HIRSCHFELD, "Projective Geometries over Finite Fields," 2nd ed., Clarendon, Oxford, 1998.
7. J. W. P. HIRSCHFELD AND L. STORME, The packing problem in statistics, coding theory, and finite projective spaces, J. Statist. Plann. Inference, to appear.
8. S. MARCUGINI, A. MILANI, AND F. PAMBIANCO, "A Computer Search for Complete Arcs in PG(2,q), q ≤ 128," Technical Report 18/95, Università degli Studi di Perugia, Italy, 1995.
9. F. PAMBIANCO AND L. STORME, Small complete caps in spaces of even characteristic, J. Combin. Theory. Ser. A 75 (1996), 70-84.
10. G. F. ROYLE, An orderly algorithm and some applications in finite geometry, Discrete Math. 185 (1998), 105-115.