论文信息 - Extensions of Generalized Product Caps

Extensions of Generalized Product Caps

We give some variants of a new construction for caps. As an application of these constructions, we obtain a 1216-cap in PG(9,3) a 6464-cap in PG(11,3) and several caps in ternary affine spaces of larger dimension, which lead to better asymptotics than the caps constructed by Calderbank and Fishburn [1]. These asymptotic improvements become visible in dimensions as low as 62, whereas the bound from Calderbank and Fishburn [1] is based on caps in dimension 13,500.

Yves Edel

[1] B. Segre. Le geometrie di Galois , 1959 .

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

[3] A. Robert Calderbank,et al. Maximal three-independent subsets of {0, 1, 2}n , 1994, Des. Codes Cryptogr..

[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[5] Yves Edel,et al. Recursive constructions for large caps , 1999 .

[6] J. Hirschfeld,et al. The packing problem in statistics, coding theory and finite projective spaces : update 2001 , 2001 .

[7] Yves Edel,et al. 41 is the Largest Size of a Cap in PG(4,4) , 1999, Des. Codes Cryptogr..

[8] Yves Edel,et al. Large Caps in Small Spaces , 2001, Des. Codes Cryptogr..

[9] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[10] A. C. Mukhopadhyay. Lower Bounds on mt(r, s) , 1978, J. Comb. Theory, Ser. A.

[11] J. Thas,et al. General Galois geometries , 1992 .

[12] Leo Storme,et al. The Classification of the Largest Caps in AG(5, 3) , 2002, J. Comb. Theory, Ser. A.