A recursive construction for new symmetric designs

Authors:
Yury J. Ionin;Hadi Kharaghani
Affiliations:
Department of Mathematics, Central Michigan University, Mt. Pleasant, MI;Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, Canada
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 3
Cited 3

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

Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

Designs, Codes and Cryptography
A series of Menon designs and 1-rotational designs

Finite Fields and Their Applications
Recent progress in algebraic design theory

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a recursive construction of regular Handamard matrices with row sum 2h for h = ±3n Whenever q = (2h - 1)2 is a prime power, we construct, for every positive integer m, a symmetric designs with parameters (4h2(qm+1 - 1)/(q - 1), (2h2 - h)qm, (h2 - h)qm).