Abstract

Hadamard matrices have many application in computer science and communication technology. It is shown that two classical methods of constructing Hadamard matrices viz., those of Paley2019;s and Williamson2019;s can be unified and Paley2019;s and Williamson2019;s Hadamard matrices can be constructed by a uniform method i.e. producing an association scheme or coherent configuration by Frobenius group action and then producing Hadamard matrices by taking suitable (1-1) 2013; linear combinations of adjacency matrices of the coherent configuration.