Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Professor Jennifer Seberry
We use a new algorithm to find new sets of sequences with entries from {0, ±a, ±b, ±c, ±d}, on the commuting variables a, b, c, d, with zero autocorrelation function. Then we use these sequences to construct a series of new three and four variable orthogonal designs in order 36. We show that the necessary conditions plus (.s1, s2, s3, s4) not equal to 12816 18 816 221313 26721 36 816 4889 12825 191313 23 424 289 9 381015 8899 14425 22 916 are sufficient for the existence of an OD(36; s1, s2 s3, s4) constructed using four circulant …
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
Professor Jennifer Seberry
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by A. V. Geramita and Jennifer Seberry, has now been out of print for almost two decades. Many of the results on weighing matrices presented therein have been greatly improved. Here we review the theory, restate some results which are no longer available and expand on the existence of many new weighing matrices and orthogonal designs of order 2n where n is odd. We give a number of new constructions for orthogonal designs. Then using number theory, linear algebra and computer searches we find new weighing …
An Algorithm To Find Formulae And Values Of Minors For Hadamard Matrices: Ii, C. Koukouvinos, E. Lappas, M. Mitrouli, Jennifer Seberry
An Algorithm To Find Formulae And Values Of Minors For Hadamard Matrices: Ii, C. Koukouvinos, E. Lappas, M. Mitrouli, Jennifer Seberry
Professor Jennifer Seberry
An algorithm computing the (n — j) x (n — j ) , j = 1, 2, ... minors of Hadamard matrices of order n is presented. Its implementation is analytically described step by step for several values of n and j. For j = 7 the values of minors are computed for the first time. A formulae estimating all the values of (n — j) x (n — j) minors is predicted.