Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A New Algorithm for Computer Searches for Orthogonal Designs

S. Georgiou1, C. Koukouvinos 1, M. Mitrouli 2, Jennifer Seberry 3
1Department of Mathematics National Technical University of Athens Zografou 15773, Athens, Greece
2Department of Mathematics University of Athens Panepistemiopolis 15784, Athens, Greece
3School of IT and Computer Science University of Wollongong Wollongong, NSW, 2522, Australia
  • Published: 30/11/2001

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,\pm a, \pm b, \pm c,\pm d\}\) on the commuting variables \(a, b, c, d\) with zero autocorrelation function.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
S. Georgiou, C. Koukouvinos , M. Mitrouli , Jennifer Seberry . A New Algorithm for Computer Searches for Orthogonal Designs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 039. 49-63. DOI: .