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
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...
Let A =(si) be an n-tuple of positive integers such that Esi = 2k. We give an algorithm which shows...
We generalise a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variable...
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...
This is a short note showing the existence of all twovariable designs in order 80 except possibly (1...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Infinite families of amicable orthogonal designs are constructed with (i) both of type (1, q) in ord...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
iv, 64 leaves : ill., map ; 29 cm.Our main aim in this thesis is to study and search for orthogonal ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
An orthogonal design of order n and type (s1, S2) on the commuting variables x1, X2 is a matrix of o...
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...
Let A =(si) be an n-tuple of positive integers such that Esi = 2k. We give an algorithm which shows...
We generalise a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variable...
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...
This is a short note showing the existence of all twovariable designs in order 80 except possibly (1...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Infinite families of amicable orthogonal designs are constructed with (i) both of type (1, q) in ord...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
iv, 64 leaves : ill., map ; 29 cm.Our main aim in this thesis is to study and search for orthogonal ...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
An orthogonal design of order n and type (s1, S2) on the commuting variables x1, X2 is a matrix of o...
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...
Let A =(si) be an n-tuple of positive integers such that Esi = 2k. We give an algorithm which shows...
We generalise a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variable...