Corpus ID: 125193002

Two infinite families of symmetric hadamard matrices

  title={Two infinite families of symmetric hadamard matrices},
  author={J. Seberry and N. A. Balonin},
A construction method for orthogonal ±1 matrices based on a variation of the Williamson array, first described by N.A. Balonin, on his web page where he called it the propus array, gives symmetric propus-Hadamard matrices using A B B D B D −A −B B −A −D B D −B B −A We show that: for q ≡ 1 (mod 4), a prime power, symmetric propusHadamard matrices exist for order 2(q + 1); and for q ≡ 1 (mod 4), a prime power, and 12(q + 1) a prime power or the order of the core of… Expand
New infinite families of Williamson Hadamard matrices
The aim of this paper is to present new families of WMs and WTMs with blocks of even order by exploiting a recently established correspondence between perfect quaternionic sequences and relative difference sets. Expand
Symmetric Hadamard Matrices of Orders 268, 412, 436 and 604
The Orbit method for the search of three cyclic blocks to construct Hadamard matrices of propus type speeds up the classical search of required sequences by distributing them into different bins using a hash-function. Expand
Some new symmetric Hadamard matrices
The first examples of symmetric Hadamard matrices of orders 4 · 127 and 4 · 191 are presented. The systematic computer search for symmetric Hadamard matrices based on the so called propus array wasExpand
Как гипотезе Адамара помочь стать теоремой. Часть 1
Introduction: Hadamard conjecture about the existence of specific square matrices was formulated not by Hadamard but by other mathematicians in the early 20th century. Later, this problem was revisedExpand
Symmetric Hadamard matrices of orders 268, 412, 436 and 604
We construct many symmetric Hadamard matrices of small order by using the so called propus construction. The necessary difference families are constructed by restricting the search to the familiesExpand
A Construction for 0, 1, -1 Orthogonal Matrices Visualized
Propus is a construction for orthogonal \(\pm 1\) matrices, which is based on a variation of the Williamson array, called the propus array $$\begin{aligned} \left[ \begin{matrix} A&{} B &{} B &{}Expand
The aim of the conducted research is development and search of analysis algorithms of textural images. The software products, which allow analyzing successfully textures in details, can be used inExpand


On Hadamard matrices
Abstract Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall arrays and four (1, −1) matrices A, B, C, D of order m which are of Williamson type,Expand
Williamson matrices of even order
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall arrays and Williamson-type matrices. These latter are four (1,-1) matrices A,B,C,D, of order m,Expand
Hadamard matrices, Sequences, and Block Designs
One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12 and 20, with entries ±1, which had all their rows (and columns) pairwise orthogonal. These matrices, X =Expand
Signed Groups, Sequences, and the Asymptotic Existence of Hadamard Matrices
  • R. Craigen
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 1995
New values of t are obtained such that, for any odd number p, there exists an Hadamard matrix of order 2 t p, and there exists a circulant signed group Hadamards matrix of every even order n, using a suitable signed group. Expand
New D-optimal designs via cyclotomy and generalised cyclotomy
  • Marc Gysin
  • Mathematics, Computer Science
  • Australas. J Comb.
  • 1997
D-optimal designs are given here for the first time, via computer-search, for v = ~ = 7,13,19,21,31,33,37,41,43,61,73,85,91,93,113. Expand
On orthogonal matrices
On Orthogonal Matrices Majid Behbahani Depar tment of Mathemat i c s and Computer Science Universi ty of Lethbridge M. Sc. Thesis , 2004 Our main aim in this thesis is to study and search forExpand
Symmetric Hadamard matrices of order 116 and 172 exist
Abstract We construct new symmetric Hadamard matrices of orders 92, 116, and 172. While the existence of those of order 92 was known since 1978, the orders 116 and 172 are new. Our construction isExpand
An experimental search and new combinatorial designs via a generalisation of cyclotomy
Cyclotomy can be used to construct a variety of combinatorial designs, for example, supplementary difference sets, weighing matrices and T -matrices. These designs may be obtained by using linearExpand
Hadamard matrices, orthogonal designs and construction algorithms
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 twoExpand
D-optimal designs embedded in Hadamard matrices and their effect on the pivot patterns
Abstract In this paper we develop a new approach for detecting if specific D-optimal designs exist embedded in Sylvester–Hadamard matrices. Specifically, we investigate the existence of the D-optimalExpand