Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Construction Methods
Known Results
References
All Topics
Mathematics
Applied Mathematics

On skew-Hadamard matrices

Profile image of Stella StylianouStella Stylianou

2008, Discrete Mathematics

https://doi.org/10.1016/J.DISC.2006.06.037
visibility

…

description

9 pages

link

1 file

Abstract

Skew-Hadamard matrices are of special interest due to their use, among others, in constructing orthogonal designs. In this paper, we give a survey on the existence and equivalence of skew-Hadamard matrices. In addition, we present some new skew-Hadamard matrices of order 52 and improve the known lower bound on the number of the skew-Hadamard matrices of this order.

Related papers

On Construction of Hadamard Matrices
IRE Journals

Iconic Research and Engineering Journals, 2020

This paper describes a specific construction of Hadamard matrices of order with the help of two block matrices and order under some conditions. It is tested that this construction works for =. Some related results are also given.

View PDFchevron_right
On the Construction of Hadamard Matrices
Pankaj Kumar Manjhi

International journal of pure and applied mathematics, 2018

In this paper we forward a method of construction of hadamard matrix with the help of two block matrices J and A under some restrictions on matrix A.

View PDFchevron_right
Skew Hadamard designs and their codes
Patrick Sole

Designs, Codes and Cryptography, 2008

Skew Hadamard designs (4n − 1, 2n − 1, n − 1) are associated to order 4n skew Hadamard matrices in the natural way. We study the codes spanned by their incidence matrices A and by I + A and show that they are self-dual after extension (resp. extension and augmentation) over fields of characteristic dividing n. Quadratic Residues codes are obtained in the case of the Paley matrix. Results on the p−rank of skew Hadamard designs are rederived in that way. Codes from skew Hadamard designs are classified. An optimal self-dual code over GF (5) is rediscovered in length 20. Six new inequivalent [56, 28, self-dual codes over GF are obtained from skew Hadamard matrices of order 56, improving the only known quadratic double circulant code of length 56 over GF (7).

View PDFchevron_right
Some remarks on Hadamard matrices
Jennifer Seberry

Cryptography and Communications, 2010

In this note we use combinatorial methods to show that the unique, up to equivalence, 5 × 5 (1, −1)-matrix with determinant 48, the unique, up to equivalence, 6 × 6 (1,−1)-matrix with determinant 160, and the unique, up to equivalence, 7 × 7 (1,−1)-matrix with determinant 576, all cannot be embedded in the Hadamard matrix of order 8. We also review some properties of Sylvester Hadamard matrices, their Smith Normal Forms, and pivot patterns of Hadamard matrices when Gaussian Elimination with complete pivoting is applied on them. The pivot values which appear reconfirm the above non-embedding results.

View PDFchevron_right
Bush-type Hadamard matrices and symmetric designs
Vladimir Tonchev

Journal of Combinatorial Designs, 2001

A symmetric 2-100Y 45Y 20 design is constructed that admits a tactical decomposition into 10 point and block classes of size 10 such that every point is in either 0 or 5 blocks from a given block class, and every block contains either 0 or 5 points from a given point class. This design yields a Bush-type Hadamard matrix of order 100 that leads to two new in®nite classes of symmetric designs with parameters # 10081 m 81 mÀ1 Á Á Á 81 1Y 4581 m Y ! 2081 m Y and # 100121 m 121 mÀ1 Á Á Á 121 1Y 55121 m Y ! 30121 m Y where m is an arbitrary positive integer. Similarly, a Bush-type Hadamard matrix of order 36 is constructed and used for the construction of an in®nite family of designs with parameters v 3625 m 25 mÀ1 Á Á Á 51 1Y k 1525 m Y ! 625 m Y and a second in®nite family of designs with parameters v 3649 m 49 mÀ1 Á Á Á 49 1Y k 2149 m Y ! 1249 m Y where m is any positive integer.

View PDFchevron_right
Higher dimensional orthogonal designs and hadamard matrices
Jennifer Seberry

Lecture Notes in Mathematics, 1980

View PDFchevron_right
Structural properties of Hadamard designs
Eric Merchant

Finite Geometries, Groups, and Computation, 2006

This dissertation focusses on structural properties of Hadamard designs. These are designs obtained from Hadamard matrices, which have been crucial objects of combinatorial study for over 100 years. The structural properties of interest are: lines, colines, good points and good blocks. These properties have a geometric flavor, and allow us to apply ideas from finite geometry. We also closely examine v CURRICULUM VITA NAME OF AUTHOR: Eric Merchant

View PDFchevron_right
On some applications of Hadamard matrices
Tadeusz Wysocki

Modern communications systems are heavily reliant on statistical techniques to recover information in the presence of noise and interference. One of the mathematical structures used to achieve this goal is Hadamard matrices. They are used in many different ways and some examples are given. This paper concentrates on code division multiple access systems where Hadamard matrices are used for user separation. Two older techniques from design and analysis of experiments which rely on similar processes are also included. We give a short bibliography (from the thousands produced by a google search) of applications of Hadamard matrices appearing since the paper of Hedayat and Wallis in 1978 and some applications in telecommunications.

View PDFchevron_right
The excess of Hadamard matrices and optimal designs
Nikos Stratis

Discrete Mathematics, 1987

Hadamard matrices of order n with maximum excess o(n) are constructed for n = 40, 44, 48, 52, 80, 84. The results are: o(40)= 244, o(44)= 280, o(48)= 324, o(52)= 364, o(80)= 704, 0(84) = 756. A table is presented listing the known values of o(n) 0< n ~< 100 and the corresponding Hadamard matrices are constructed. For the remaining values of n = 56, 60, 68, 72, 76, 88, 92, 96 the largest values achieved for the excess are also given.

View PDFchevron_right
A construction for Hadamard arrays
Jennifer Seberry

Bulletin of the Australian Mathematical Society, 1972

We give a construction for Hadamard arrays and exhibit the arrays of orders 4t, t ∈ {1, 3, 5, 7, …, 19}. This gives seventeen new Hadamard matrices of order less than 4000.

View PDFchevron_right

References (41)

  1. A.H. Baartmans, C. Lin, W.D. Wallis, Symmetric and skew equivalence of Hadamard matrices of order 28, Ars. Combin. 41 (1995) 25-31.
  2. D. Blatt, G. Szekeres, A skew Hadamard matrix of order 52, Canad. J. Math. 21 (1969) 1319-1322.
  3. J. Cooper, J. Milas, W.D. Wallis, Hadamard equivalence, Combinatorial Mathematics, Lecture Notes in Mathematics, vol. 686, Springer, Berlin, Heidelbert, New York, 1978, pp. 126-135.
  4. R. Craigen, Hadamard matrices and designs, The CRC Handbook of Combinatorial Designs, in: C.J. Colbourn, J.H. Dinitz (Eds.), CRC Press, Boca Raton, Fl, (1996), 370-377.
  5. D.Z. Djokovic, Skew Hadamard matrices of order 4 × 37 and 4 × 43, J. Combin. Theory Ser. A 61 (1992) 319-321.
  6. D.Z. Djokovic, Ten new orders for Hadamard matrices of skew type, Univ. Beograd. Pupl. Electrotehn. Fak. Ser. Math. 3 (1992) 47-59.
  7. D.Z. Djokovic, Construction of some new Hadamard matrices, Bull. Austral. Math. Soc. 45 (1992) 327-332.
  8. D.Z. Djokovic, Good matrices of order 33, 35 and 127 exist, J. Combin. Math. Combin. Comput. 14 (1993) 145-152.
  9. D.Z. Djokovic, Five new orders for Hadamard matrices of skew type, Australasian J. Combin. 10 (1994) 259-264.
  10. D.Z. Djokovic, Six new orders for G-matrices and some new orthogonal designs, J. Combin. Inform. System Sci. 20 (1995) 1-7.
  11. D.Z. Djokovic, Skew-Hadamard matrices of order 188 and 388 exist, submitted.
  12. C. Elster, A. Neumaier, Screening by conference designs, Biometrika 82 (1995) 589-602.
  13. R.J. Fletcher, C. Koukouvinos, J. Seberry, New skew-Hadamard matrices of order 4 • 49 and new D-optimal designs of order 2 • 59, Discrete Math. 286 (2004) 251-253.
  14. S. Georgiou, C. Koukouvinos, On circulant G-matrices, J. Combin. Math. Combin. Comput. 40 (2002) 205-225.
  15. S. Georgiou, C. Koukouvinos, Some results on orthogonal designs and Hadamard matrices, Int. J. Appl. Math. 17 (2005) 433-443.
  16. S. Georgiou, C. Koukouvinos, J. Seberry, On circulant best matrices and their applications, Linear and Multilinear Algebra 48 (2001) 263-274.
  17. S. Georgiou, C. Koukouvinos, S. Stylianou, On good matrices, skew Hadamard matrices and optimal designs, Comput. Statist. Data Anal. 41 (2002) 171-184.
  18. S. Georgiou, C. Koukouvinos, S. Stylianou, New skew Hadamard matrices and their application in edge designs, Utilitas Math. 66 (2004) 121-136.
  19. S. Georgiou, C. Koukouvinos, S. Stylianou, Construction of new skew Hadamard matrices and their use in screening experiments, Comput. Statist. Data Anal. 45 (2004) 423-429.
  20. A.V. Geramita, J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York, Basel, 1979.
  21. J.M. Goethals, J.J. Seidel, A skew Hadamard matrix of order 36, J. Austral. Math. Soc. 11 (1970) 343-344.
  22. H. Kharaghani, B. Tayfeh-Rezaie, A Hadamard matrix of order 428, J. Combin. Designs 13 (2005) 435-440.
  23. C. Koukouvinos, J. Seberry, On G-matrices, Bull. ICA 9 (1993) 40-44.
  24. S. Kounias, T. Chadjipantelis, Some D-optimal weighing designs for n ≡ 3 (mod 4), J. Statist. Plann. Inference 8 (1983) 117-127.
  25. R.E.A.C. Paley, On orthogonal matrices, J. Math. Phys. 12 (1933) 311-320.
  26. J. Seberry Wallis, (v, k, ) configurations and Hadamard matrices, J. Austral. Math. Soc. 11 (1970) 297-309.
  27. J. Seberry Wallis, A skew-Hadamard matrix of order 92, Bull. Austral. Math. Soc. 5 (1971) 203-204.
  28. J. Seberry Wallis, Some (1, -1) matrices, J. Combin. Theory Ser. B 10 (1971) 1-11.
  29. J. Seberry Wallis, On supplementary difference sets, Aequationes Math. 8 (1972) 242-257.
  30. J. Seberry Wallis, On Hadamard matrices, J. Combin. Theory Ser. A 18 (1975) 149-164.
  31. J. Seberry Wallis, Construction of Williamson type matrices, Linear and Multilinear Algebra 3 (1975) 197-207.
  32. J. Seberry Wallis, On skew Hadamard matrices, Ars Combin. 6 (1978) 255-275.
  33. J. Seberry Wallis, A.L. Whiteman, Some classes of Hadamard matrices with constant diagonal, Bull. Austral. Math. Soc. 7 (1972) 233-249.
  34. J. Seberry, M.Yamada, Hadamard matrices, sequences and block designs, in: J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory-A Collection of Surveys, Wiley, New York, 1992, pp. 431-560.
  35. E. Spence, Skew-Hadamard matrices of order 2(q + 1), Discrete Math. 18 (1977) 79-85.
  36. G. Szekeres, Cyclotomy and complementary difference sets, Acta Arith. 18 (1971) 349-353.
  37. G. Szekeres, A note on skew type orthogonal ±1 matrices, in: A. Hajnal, L. Lovász, V.T. Sòs (Eds.), Combinatorics, Colloquia Mathematica Societatis, Janos Bolyai, vol. 52, North-Holland, Amserdam, 1988, pp. 489-498.
  38. W.D. Wallis, A.P. Street, J. Seberry Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Mathematicsa, vol. 292, Springer, Berlin, Heidelberg, New York, 1972.
  39. A.L. Whiteman, An infinite family of skew-Hadamard matrices, Pacific J. Math. 38 (1971) 817-822.
  40. A.L. Whiteman, Skew Hadamard matrices of Goethals-Seidel type, Discrete Math. 2 (1972) 397-405.
  41. X.-M. Zhang, G-matrices of order 19, Bull. ICA 4 (1992) 95-98.

Related papers

New skew-Hadamard matrices of order and new D-optimal designs of order
Jennifer Seberry

Discrete Mathematics, 2004

We give two new circlulant D-optimal designs of order 118, which are of Ehlich's type. We note this is the first time that a D-optimal has been constructed for order 118 = 2 · 59. As a consequence new skew-Hadamard matrices of order 236 = 4 · 59 are also constructed for the first time.

View PDFchevron_right
Some Orthogonal Designs and complex Hadamard matrices by using two Hadamard matrices
Jennifer Seberry

We prove that if there exist Hadamard matrices of order h and n divisible by 4 then there exist two disjoint W(1 4 hn; 1 8 hn), whose sum is a (1;?1) matrix and a complex Hadamard matrix of order 1 4 hn, furthermore, if there exists an OD(m; s 1 ; s 2 ; ; s l) for even m then there exists an OD(1 4 hnm; 1 4 hns 1 ; 1 4 hns 2 ; ; 1 4 hns l):

View PDFchevron_right
On good matrices, skew Hadamard matrices and optimal designs
Stelios Georgiou

Computational Statistics & Data Analysis, 2002

In two-level factorial experiments and in other linear models the coe cients of the unknown parameters can take one out of two values. When the number of observations is a multiple of four, the D-optimal design is a Hadamard matrix. Skew Hadamard matrices are of special interest due to their use, among others, in constructing D-optimal weighing designs for n ≡ 3 (mod 4). A method is given for constructing skew Hadamard matrices which is based on the construction of good matrices. The construction is achieved through an algorithm which is also presented and relies on the discrete Fourier transform.

View PDFchevron_right
Hadamard Matrices, Orthogonal Designs and Construction Algorithms
Jennifer Seberry

Designs 2002, 2003

We discuss algorithms for the construction of Hadamard matrices. We include discussion of construction using Williamson matrices, Legendre pairs and the discret Fourier transform and the two circulants construction. Next we move to algorithms to determine the equivalence of Hadamard matrices using the profile and projections of Hadamard matrices. A summary is then given which considers inequivalence of Hadamard matrices of orders up to 44. The final two sections give algorithms for constructing orthogonal designs, short amicable and amicable sets for use in the Kharaghani array.

View PDFchevron_right
A combined approach to the construction of Hadamard matrices
Rob Craigen

We introduce a general approach which combines the strength of a method recently introduced by Kharaghani with that of orthogonal deorthogonal and sequences, to some very classes of Hadamard matrices. We construct Hadamard matrices of orders 4N(tw+h+k) and 4N(hw+ kv), where v, ware the weights of 2-complementary (0, ±l)-sequenC(~s, and N, t, hand k can take on various values. 'WI, ... , Wu are the weights of the orthogonal design. An equivalent formulation (the usual requires instead that WI, ... , Wn be disjoint (0, ± 1)-matrices and that DDt X1 2 .. + wux})I.

View PDFchevron_right

Related topics

  • Mathematics
  • Applied Mathematics
  • Computer Science
  • Pure Mathematics
  • Orthogonal design

    • Cited by

    Robust Hadamard Matrices, Unistochastic Rays in Birkhoff Polytope and Equi-Entangled Bases in Composite Spaces
    Karol Życzkowski

    Mathematics in Computer Science, 2018

    We study a special class of (real or complex) robust Hadamard matrices, distinguished by the property that their projection onto a 2-dimensional subspace forms a Hadamard matrix. It is shown that such a matrix of order n exists, if there exists a skew Hadamard matrix or a symmetric conference matrix of this size. This is the case for any even n ≤ 20, and for these dimensions we demonstrate that a bistochastic matrix B located at any ray of the Birkhoff polytope, (which joins the center of this body with any permutation matrix), is unistochastic. An explicit form of the corresponding unitary matrix U , such that B i j = |U i j | 2 , is determined by a robust Hadamard matrix. These unitary matrices allow us to construct a family of orthogonal bases in the composed Hilbert space of order n × n. Each basis consists of vectors with the same degree of entanglement and the constructed family interpolates between the product basis and the maximally entangled basis. In the case n = 4 we study geometry of the set U 4 of unistochastic matrices, conjecture that this set is star-shaped and estimate its relative volume in the Birkhoff polytope B 4 .

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved