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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T Beth D Jungnickel H Lenz (1999) Design Theory EditionNumber2 Cambridge University Press Cambridge, UK
The CRC Handbook of Combinatorial Designs, C.J. Colbourn and J.H. Dinitz (eds), CRC Press (1996).
Y. J. Ionin (1998) ArticleTitleA technique for constructing symmetric designs Designs, Codes and Cryptography 14 147–158
Y. J. Ionin, New symmetric designs from regular Hadamard matrices, The Electronic Journal of Combinatorics, Vol. 5 (1998), R1.
Z. Janko H. Kharaghani V. Tonchev (2001) ArticleTitleBush-type Hadamard matrices and symmetric designs Journal of Combinatorial Designs 9 72–78
Z. Janko H. Kharaghani V. Tonchev (2001) ArticleTitleThe existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs Designs, Codes and Cryptography 24 225–232
H. Kharaghani, On the twin designs with the Ionin-type parameters, The Electronic Journal of Combinatorics, Vol. 7 (2000) R1.
H. Kharaghani, On the Siamese twin designs, in: Finite Fields and Applications, D. Jungnickel and H. Niederreiter (eds), Springer-Verlag, Berlin, Heidelberg (2001) pp. 303–312.
A. C. Mukhopadhay (1978) ArticleTitleSome infinite classes of Hadamard matrices J. Combin. Theory A 25 128–141
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ionin, Y.J., Kharaghani, H. A Recursive Construction for New Symmetric Designs. Des Codes Crypt 35, 303–310 (2005). https://doi.org/10.1007/s10623-003-6740-0
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-003-6740-0