Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

University of Wollongong

Faculty of Informatics - Papers (Archive)

AMS Subject Classification: Primary 05B20

Publication Year

Articles 1 - 5 of 5

Full-Text Articles in Entire DC Network

Inequivalence Of Nega-Cyclic ±1 Matrices, R. Ang, Jennifer Seberry, Tadeusz A. Wysocki Jan 2006

Inequivalence Of Nega-Cyclic ±1 Matrices, R. Ang, Jennifer Seberry, Tadeusz A. Wysocki

Faculty of Informatics - Papers (Archive)

We study nega-cyclic ±1 matrices. We obtain preliminary results which are then used to decrease the search space. We find that there are 2, 4, 9, 23, 63, and 187 ip-equivalence classes for lengths 3, 5, 7, 9, 11, and 13 respectively. The matrices we find are used in a variant given here of the Goethals-Seidel array to form Hadamard matrices, the aim being to later check them for suitability for CDMA schemes.


On Circulant Best Matrices And Their Applications, S. Georgiou, C. Koukouvinos, Jennifer Seberry Jul 2001

On Circulant Best Matrices And Their Applications, S. Georgiou, C. Koukouvinos, Jennifer Seberry

Faculty of Informatics - Papers (Archive)

Call four type 1(1,-1) matrices, x1,x2,x3,x4; of the same group of order m (odd) with the properties (i) (Xi-I)T = -(Xi-I), i=1,2,3, (ii)XT4 = X4 and the diagonal elements are positive, (iii) XiXj = XjXi and (iv) X1XT1 + X2XT2+X3XT3 +X4XT4 = 4mIm, best matrices. We use a computer to give, for the first time, all inequivalent best matrices …


Values Of Minors Of (1,-1) Incidence Matrices Of Sbibds And Their Application To The Growth Problem, C Koukouvinos, M Mitrouli, Jennifer Seberry Jan 2001

Values Of Minors Of (1,-1) Incidence Matrices Of Sbibds And Their Application To The Growth Problem, C Koukouvinos, M Mitrouli, Jennifer Seberry

Faculty of Informatics - Papers (Archive)

We obtain explicit formulae for the values of the v j minors, j = 0, 1,2 of (1, -1) incidence matrices of SBIBD(v, k, λ). This allows us to obtain explicit information on the growth problem for families of matrices with moderate growth. An open problem remains to establish whether the (1, -1) CP incidence matrices of SBIBD(v, k, λ), can have growth greater than v for families other than Hadamard families.


When The Necessary Conditions Are Not Sufficient: Sequences With Zero Autocorrelation Function, J. Horton, Jennifer Seberry Sep 1999

When The Necessary Conditions Are Not Sufficient: Sequences With Zero Autocorrelation Function, J. Horton, Jennifer Seberry

Faculty of Informatics - Papers (Archive)

Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification of Circulant Weighing Matrices of Weight 9, Bar-Ilan University, Ramat-Gan, 1997, have intensively studied circulant weighing matrices, or single sequences, with weight 9. They show many cases are non-existent. Here we give details of a search for two sequences with zero periodic autocorrelation and types (1,9), (1,16) and (4,9). We find some new cases but also many cases where the known necessary conditions are not sufficient. We instance a number of occasions when the known necessary conditions are not sufficient for the existence of weighing …


New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry Jan 1999

New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry

Faculty of Informatics - Papers (Archive)

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 …