Skip to main content
Log in

Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

If H is a regular Hadamard matrix with row sum 2h, m is a positive integer, and q = (2h − 1)2, then (4h 2(q m + 1 − 1)/(q −1),(2h 2h)q m,(h 2-h)q m) are feasible parameters of a symmetric designs. If q is a prime power, then a balanced generalized weighing matrix BGW((q m +1 − 1)/(q−1),q m,q mq m −1) can be applied to construct such a design if H satisfies certain structural conditions. We describe such conditions and show that if H satisfies these conditions and B is a regular Hadamard matrix of Bush type, then B×H satisfies these structural conditions. This allows us to construct parametrically new infinite families of symmetric designs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge, UK, second edition (1999).

    Google Scholar 

  2. C. J. Colbourn and J. H. Dinitz (eds.), The CRC Handbook of Combinatorial Designs, CRC Press (1996).

  3. Y. J. Ionin, A technique for constructing symmetric designs, Designs, Codes and Cryptography, Vol. 14 (1998) pp. 147–158.

    Google Scholar 

  4. Y. J. Ionin, New symmetric designs from regular Hadamard matrices, The Electronic Journal of Combinatorics, Vol. 5 (1998) p. R1.

    Google Scholar 

  5. Y. J. Ionin and H. Kharaghani, A recursive construction for new symmetric designs, Designs, Codes and Cryptography (to appear).

  6. Z. Janko, The existence of a Bush-type Hadamard matrix of order 36 and two new infinite classes of symmetric designs (preprint).

  7. Z. Janko, H. Kharaghani and V. D. Tonchev, A Bush-type Hadamard matrix of order 100 and two new infinite classes of symmetric designs, Designs, Codes and Cryptography, Vol. 24 (2001) pp. 225–232.

    Google Scholar 

  8. Z. Janko, H. Kharaghani and V. D. Tonchev, The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs, J. Combinatorial Designs, Vol. 9 (2001) pp. 72–78.

    Google Scholar 

  9. H. Kharaghani, New classes of weighing matrices, Ars Combinatoria, Vol. 19 (1985) pp. 69–72.

    Google Scholar 

  10. H. Kharaghani, On the twin designs with the Ionin-type parameters, The Electronic Journal of Combinatorics, Vol. 7 (2000) p. R1.

    Google Scholar 

  11. H. Kharaghani, On the Siamese twin designs, In D. Jungnickel and H. Niederreiter (eds.), Finite Fields and Applications, Springer-Verlag, Berlin, Heidelberg (2001) pp. 303–312.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ionin, Y.J. Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs. Designs, Codes and Cryptography 32, 227–233 (2004). https://doi.org/10.1023/B:DESI.0000029225.69728.39

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000029225.69728.39

Navigation