The 95256-cap in PG(12; 4) is complete

2015/09/23 by D. Bartoli, Daniele Bartoli, Stefano Marcugini +9
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #graph theory and CDMA systems #math.CO #msc:51E21 #msc:51E22 #msc:94B05

paper · pdf · doi:10.48550/arxiv.1509.07059

arxiv created 2015/09/23 · arxiv updated 2015/09/24

Abstract

We describe an algorithm for testing the completeness of caps in PG(r; q), q even. It allowed us to check that the 95256-cap in PG(12; 4) recently found by Fu el al. (see [14]) is complete.

Related

• A computer based classification of caps in PG(4,2)
• A computer based classification of caps in PG(4,3)
• A computer based classification of caps in PG(5,2)
• On k-caps in PG(n, q), with q even and n ≥ 4
• On k-caps in PG(n, q), with q even and n ≥ 3