论文信息 - Computer search for small complete caps

Computer search for small complete caps

A computer search method for finding small complete caps inPG(d,q) is considered. The problem is formulated as a combinatorial optimization problem to which record-to-record travel, a stochastic local search method, is applied. Several new complete caps are found and upper bounds on the number of points in the smallest complete caps inPG(d,q) are tabulated for small parameters.

Patric R. J. Osterg Aa Rd

[1] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .

[2] Gordon F. Royle. An orderly algorithm and some applications in finite geometry , 1998, Discret. Math..

[3] J. Hirschfeld. Finite projective spaces of three dimensions , 1986 .

[4] J. Hirschfeld,et al. The packing problem in statistics, coding theory and finite projective spaces , 1998 .

[5] Fernanda Pambianco,et al. On the spectrum of the valuesk for which a completek- cap in PG(n, q) exists , 1998 .

[6] G. Dueck. New optimization heuristics , 1993 .

[7] Fernanda Pambianco,et al. Small Complete Caps in Spaces of Even Characteristic , 1996, J. Comb. Theory, Ser. A.

[8] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .