Amicable complex orthogonal designs

Chau Yuen*, Yong Liang Guan, Tjeng Thiang Tjhung

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACODs from lower-order ACODs. We found that the upper bound on the number of variables of an ACOD is the same as that of amicable orthogonal designs (AOD). We also show that certain types of AOD that were previously shown to be non-existent or undecided, such as AODs of order 8 with type (1, 1, 1, 1; 2, 2, 2, 2) and (1, 2, 2, 2; 1, 2, 2, 2), can be found from ACODs constructed using our proposed construction methods. Our proposed methods can also be used to systematically construct new AODs that are of the same type as, but not equivalent to, those previously found by Zhao, Wang and Seberry using computer search. An interesting finding arising from this study is that an AOD or ACOD can be constructed from a lower-order amicable family (AF) or amicable complex family (ACF). This implies that the component matrices for constructing a higher-order AOD/ACOD need not be disjoint.

Original languageEnglish
Pages (from-to)111-121
Number of pages11
JournalAustralasian Journal of Combinatorics
Volume44
Publication statusPublished - Jun 2009
Externally publishedYes

ASJC Scopus Subject Areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Amicable complex orthogonal designs'. Together they form a unique fingerprint.

Cite this