We construct a family of simple 3-(2m, 8, 14(2m - 8)/3) designs, with odd m ≥ 5, from all ℤ4-Goethals-like codes G??k with k = 21 and l ≥ 1. In addition, these designs imply also the existence of the other design families constructed from the ℤ4-Goethals codes G1 by Ranto. In the existence proofs we count the number of solutions to certain systems of equations over finite fields arid use Dickson polynomials and variants of cyclotomic polynomials and identities connecting them. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Lahtoneu, J., Ranto, K., & Vehkalahti, R. (2006). 3-designs from Z4-Goethals-like codes and variants of cyclotomic polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 55–68). Springer Verlag. https://doi.org/10.1007/11779360_6
Mendeley helps you to discover research relevant for your work.