Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

Authors:
Yury J. Ionin
Affiliations:
Department of Mathematics, Central Michigan University, Mt. Pleasant, MI 48859, U.S.A. yury.ionin@cmich.edu
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 4
Cited 0

Design theory

Design theory
A Technique for Constructing Symmetric Designs

Designs, Codes and Cryptography
The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs

Designs, Codes and Cryptography
A recursive construction for new symmetric designs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let q be a prime power and let n ≥ 0, t ≥ 1 be integers. We determine the sizes of the point orbits of each of the groups GL(n + 1, q), PGL(n + 1, q), SL(n + 1, q) ...