Covering arrays of strength 4 on 6 symbols from PGL(2, 5)-invariant starters
We study covering arrays CA(N;4,k,6) obtained by developing three starter words under G = PGL(2,5), acting on the six points of PG(1,5), and under a cyclic shift of m = k − f of the columns, the other f ∈ {0,1,2} columns being fixed. Two starters take values in PG(1,5) and one is binary, so the array has at most 270m + 6 rows. We give an explicit family: for every prime p ≡ 1 (mod 6), starters defined by the sextic residue character of F_p give a CA(270p + 6; 4, p + f, 6) for f = 0, 1, 2, if and only if p ∉ {7, 13, 19, 31, 61}. The proof combines Weil's bound for p ≥ 3396 with an exact computer check for smaller p. We also determine for which k some starters exist: for f = 0 exactly when k = 11 or k ≥ 13, for f = 1 exactly when k = 12 or k ≥ 14, and for f = 2 when k ≥ 18 and for no k ≤ 15; the cases f = 2, k = 16, 17 are open. Existence for m ≥ 729 follows from a union bound, and the smaller cases from explicit witnesses and exhaustive searches. For k = 11, ..., 16 and k = 19, ..., 25 these arrays are smaller than the entries of Colbourn's table of November 2024, and six of them are the current entries of the ca-tools table (13 November 2026).
Authors
- Theo Nicolas Sitjar (ORCID: https://orcid.org/0009-0002-6728-0169)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24207827
- Primary Topic
- Coding theory and cryptography
- Type
- preprint