Let bp(+K v ) be the minimum number of complete bipartite subgraphs needed to partition the edge set of +K v , the complete multigraph with + edges between each pair of its v vertices. Many papers have examined bp(+K v ) for v 2+. For each + and v with v 2+, it is shown here that if certain Hadamard
Decomposition of Hadamard matrices
β Scribed by Morris Plotkin
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 146 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In answer to βResearch Problem 16β in Horadam's recent book __Hadamard matrices and their applications__, we provide a construction for generalized Hadamard matrices whose transposes are not generalized Hadamard matrices. Β© 2009 Wiley Periodicals, Inc. J Combin Designs 17: 456β458, 2009
In this paper, we prove that the concepts of cocyclic Hadamard matrix and Hadamard group are equivalent. A general procedure for constructing Hadamard groups and classifying such groups on the basis of isomorphism type is given. To illustrate the ideas, cocyclic Hadamard matrices over dihedral group
## Abstract This article derives from first principles a definition of equivalence for higherβdimensional Hadamard matrices and thereby a definition of the automorphism group for higherβdimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for
In this paper all the so-called checkered Hadamard matrices of order 16 are determined (i.e., Hadamard matrices consisting of 16 square blocks H i j of order 4 such that H ii = J 4 and H i j J 4 = J 4 H i j = 0 for i = j and where J 4 is the all-one matrix of order 4). It is shown that the checkered