We give three new constructions for orthogonal designs using amicable orthogonal designs. These are then used to show (i) all possible n-tuples, n ~ 5, are the types of orthogonal designs in order 16 and (ii) all possible n-tuples, n ~ 3 are the types of orthogonal designs in order 32, (iii) all 4-tuples, (e, f, g, 32-e-f-g) , o ~ e T f T g ~ 32 are the types of orthogonal designs in order 32. These resultg are used in a paper by Peter J. Robinson, "Orthogonal designs of order sixteen", in this same volume, to fully update the status of the existence of orthogonal designs in order 1
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are ...
Orthogonal designs of special type have been extensively studied, and it is the existence of these s...
New amicable orthogonal designs of order eight are given and they are used to construct new orthogon...
AbstractUsing a new method we construct all 18 remaining (unresolved for 20 years) full orthogonal d...
AbstractA result of Robinson states that no OD(n;1,1,1,1,1,n−5) exists for n>40. We complement this ...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
This is a short note showing the existence of all twovariable designs in order 80 except possibly (1...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Given any l-tuple (s1, s2,..., sl) of positive integers, there is an integer N = N (s1, s2,..., sl) ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are ...
Orthogonal designs of special type have been extensively studied, and it is the existence of these s...
New amicable orthogonal designs of order eight are given and they are used to construct new orthogon...
AbstractUsing a new method we construct all 18 remaining (unresolved for 20 years) full orthogonal d...
AbstractA result of Robinson states that no OD(n;1,1,1,1,1,n−5) exists for n>40. We complement this ...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
This is a short note showing the existence of all twovariable designs in order 80 except possibly (1...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Given any l-tuple (s1, s2,..., sl) of positive integers, there is an integer N = N (s1, s2,..., sl) ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...