This is a short note showing the existence of all twovariable designs in order 80 except possibly (13, 64) and (15, 62) which have not yet been construced. The designs are constructed using designs in order 8, 16, 20, and 40 and applying lemmas and theorems concerning orthogonal designs. Three-variable designs (a, b, n-a-b), which are useful in constructing Hadamard matrices, are also considered for n = 40 and 80
An orthogonal design of order n and type (s1, S2) on the commuting variables x1, X2 is a matrix of o...
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The excess of or...
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...
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...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
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...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
An orthogonal design of order n and type (s1, S2) on the commuting variables x1, X2 is a matrix of o...
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The excess of or...
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...
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...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used to ...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of ...
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...
AbstractThe use of amicable sets of eight circulant matrices and four negacyclic matrices to generat...
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications ...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed that fo...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to c...
We give a new algorithm which allows us to construct new sets of sequences with entries from the com...
Repeat designs are introduced and it is shown how they may be used to give very powerful constructio...
An orthogonal design of order n and type (s1, S2) on the commuting variables x1, X2 is a matrix of o...
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The excess of or...
v, 115 leaves ; 29 cmAn orthogonal design of order n and type (si,..., se), denoted OD(n; si,..., se...