2017/09/24 by Hadi Kharaghani, Kharaghani, Hadi, Sho Suda +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1709.08150
openalex publication_date 2017/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For prime powers q and q+ε where ε∈\1,2\, an affine resolvable design from \mathbbFq and Latin squares from \mathbbFq+ε yield a set of symmetric designs if ε=2 and a set of symmetric group divisible designs if ε=1. We show that these designs derive commutative association schemes, and determine their eigenmatrices.