A new algorithm for computer searches for orthogonal designs

Authors

S. Georgiou, National Technical University of Athens, Greece
C. Koukouvinos, National Technical University of Athens, Greece
M. Mitrouli, University of Athens, Greece
Jennifer Seberry, University of WollongongFollow

Publication Details

This article was originally published as: Georgiou, S, Koukouvinos, C, Mitrouli,M & Seberry J, Journal of Combinatorial Mathematics and Combinatorial Computing, 2001, 39, 49-63. Copyright 2001 Charles Babbage Research Centre.

Abstract

We present a new algorithm for computer searches for orthogonal designs. Then we use this 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.