Some constructions for amicable orthogonal designs
From MaRDI portal
Abstract: Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct orthogonal designs especially full orthogonal designs (no zero entries) with maximum number of variables for some orders. He constructed product designs of orders , and and types and , respectively. In this paper, we first show that there does not exist any product design of order , , and type where the notation is used to show that repeats times. Then, following the Holzmann and Kharaghani's methods, we construct some classes of disjoint and some classes of full amicable orthogonal designs, and we obtain an infinite class of full amicable orthogonal designs. Moreover, a full amicable orthogonal design of order and type is constructed.
Recommendations
Cited in
(7)- Construction of generalized rotations and quasi-orthogonal matrices
- Strong amicable orthogonal designs and amicable Hadamard matrices
- The amicable-Kronecker construction of quaternion orthogonal designs
- Amicable complex orthogonal designs
- scientific article; zbMATH DE number 36693 (Why is no real title available?)
- scientific article; zbMATH DE number 5053293 (Why is no real title available?)
- Some results on orthogonal designs and Hadamard matrices
This page was built for publication: Some constructions for amicable orthogonal designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451466)