Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes
Article comments
This article was originally published as Zhao, Y, Seberry, J, Xia, T, Wang, Y, Wysocki, BJ, Wysocki, TA and Tran, LC, Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes, Australasian Journal of Combinatorics, 34, 2006, 137-144.
Abstract
New amicable orthogonal designs AODs(8; 1; 1; 1; 2; 2; 2), AODs(8; 1; 1; 4; 1; 2; 2), AODs(8; 1; 2;2; 2; 2; 4), AODs(8; 1; 2; 2; 1; 2; 4), AODs(8; 1; 1; 2; 1; 2; 4), AODs(8; 1; 2; 4; 2; 2; 2), AODs(8; 1; 1; 4; 1; 1; 2; 2), AODs(8; 2; 2; 2; 2; 2; 2; 2; 2) and AODs(8; 1; 1; 1; 2; 1; 2; 2; 2) are found by applying a new theorem or by an exhaustive search. Also some previously undecided cases of amicable pairs are demonstrated to be non-existent after a complete search of the equivalence classes for orthogonal designs.Suggested Citation
Y. Zhao, J. Seberry, T. Xia, Y. Wang, B. J. Wysocki, T. A. Wysocki, and L. C. Tran. "Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes" Faculty of Informatics - Papers (2006).
Available at: http://works.bepress.com/jseberry/39