CONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP
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 Paley’s and Williamson’s can be unified and Paley’s and Williamson’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) – linear combinations of adjacency matrices of the coherent configuration.
