global-journal-of-computer-science-and-technology Global Journal of Computer Science and Technology 0975-4350 0975-4172 Global Journals Publishing Group Incorporated 72980 Prolific Generation of Williamson Type Matrices M.K.SinghDr. DuttaSandip MahantiN C INDIA, Ranchi University, Ranchi, India 04 05 2011 11 8 1 10

A new method of generating Williamson type Matrices A, B, C, D is described such that (i) A, B, C, D are symmetric. (ii) A, B, C are circulant matrices and D is a back circulant matrix. All such Williamsom type matrices of order n = 7, 9, 11, 13, 15, 17 are obtained by exhaustive computer search. The number of Williamson type Matrices constructed here is much greater than that of Williamson Matrices of same order. For example there are only 4 Williamson Matrices of order 17 but by our method we have obtained 504 Williamson type Matrices of order 17.

 Hadamard Matrices Williamson & Williamson type Matrices circulant and back circulant matrices turnpike or partial digest problem. Full Text

A new method of generating Williamson type Matrices A, B, C, D is described such that (i) A, B, C, D are symmetric. (ii) A, B, C are circulant matrices and D is a back circulant matrix. All such Williamsom type matrices of order n = 7, 9, 11, 13, 15, 17 are obtained by exhaustive computer search. The number of Williamson type Matrices constructed here is much greater than that of Williamson Matrices of same order. For example there are only 4 Williamson Matrices of order 17 but by our method we have obtained 504 Williamson type Matrices of order 17.