New amicable orthogonal designs of order eight are given and they are used to construct new orthogonal designs of order 32
In the past few decades, design theory has grown to encompass a wide variety of research directions....
In this paper, we present new infinite families of three and four variable orthogonal designs based ...
This paper presents new infinite families of orthogonal designs for computer experiments. In cases w...
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are ...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
AbstractUsing a new method we construct all 18 remaining (unresolved for 20 years) full orthogonal d...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Orthogonal designs of special type have been extensively studied, and it is the existence of these s...
AbstractA result of Robinson states that no OD(n;1,1,1,1,1,n−5) exists for n>40. We complement this ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
The binary codes spanned by the blocks of the six known symmetric (61,16,4) designs and their automo...
New quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs are constructed by embedding known designs...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
This paper presents new infinite families of orthogonal designs for computer experiments. In cases w...
The structure is determined for the existence of some amicable weighing matrices. This is then used ...
In the past few decades, design theory has grown to encompass a wide variety of research directions....
In this paper, we present new infinite families of three and four variable orthogonal designs based ...
This paper presents new infinite families of orthogonal designs for computer experiments. In cases w...
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are ...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
AbstractUsing a new method we construct all 18 remaining (unresolved for 20 years) full orthogonal d...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Orthogonal designs of special type have been extensively studied, and it is the existence of these s...
AbstractA result of Robinson states that no OD(n;1,1,1,1,1,n−5) exists for n>40. We complement this ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
The binary codes spanned by the blocks of the six known symmetric (61,16,4) designs and their automo...
New quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs are constructed by embedding known designs...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
This paper presents new infinite families of orthogonal designs for computer experiments. In cases w...
The structure is determined for the existence of some amicable weighing matrices. This is then used ...
In the past few decades, design theory has grown to encompass a wide variety of research directions....
In this paper, we present new infinite families of three and four variable orthogonal designs based ...
This paper presents new infinite families of orthogonal designs for computer experiments. In cases w...
DOI
Add to ORKG