Corpus ID: 9817057

Some new D-optimal designs

@article{okovi1997SomeND,
  title={Some new D-optimal designs},
  author={Dragomir Ðokovi{\'c}},
  journal={Australas. J Comb.},
  year={1997},
  volume={15},
  pages={221-232}
}
  • D. Ðoković
  • Published 1997
  • Mathematics, Computer Science
  • Australas. J Comb.
We construct several new (v; r, 8; A) supplementary difference sets with v odd and T' + .5 = A + (v 1) /2. They give rise to D-optimal designs of order 2v. D-optimal designs of orders 158, 194, and 290 are constructed here for the first time. We also give an up to date survey of this class of supplementary difference sets in arbitrary Abelian groups of odd order v < 100. o. Introduction Supplementary difference sets (SDS) in finite Abelian groups is an active topic of research. Examples of… Expand
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem: II
We obtain explicit formulae for the values of the 2v-j minors, j=0,1,2 of D-optimal designs of order 2v = x2 + y2, v odd, where the design is constructed using two circulant or type 1 incidenceExpand
On New Families of Supplementary Difference Sets over Rings with Short Orbits
We discuss difference sets (DS) and supplementary difference sets (SDS) over rings. We survey some constructions of SDS over Galois rings where there are no short orbits. ,From there we move toExpand
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem
We obtain explicit formulae for the values of the 2v — j minors, j = 0, 1, 2 of D-optimal designs of order 2v = x2 + y2, v odd, where the design is constructed using two circulant or type 1 incidenceExpand
Constructing near-Hadamard designs with (almost) D-optimality by general supplementary difference sets
We propose a new and unified construction method, general supplementary difference sets (GSDS)s, for near-Hadamard designs when the run sizes are n ≡ 2 (mod 4). These designs possess highExpand
A class of cyclic (v; k1, k2, k3; λ) difference families with v ≡ 3 (mod 4) a prime
Abstract We construct several new cyclic (v; k1, k2, k3; λ) difference families, with v ≡ 3 (mod 4) a prime and λ = k1 + k2 + k3 − (3v − 1)/4. Such families can be used in conjunction with theExpand
An experimental search and new combinatorial designs via a generalisation of cyclotomy
Cyclotomy can be used to construct a variety of combinatorial designs, for example, supplementary difference sets, weighing matrices and T -matrices. These designs may be obtained by using linearExpand
A class of cyclic $(v;k_1,k_2,k_3;\lambda)$ difference families with $v \equiv 3 \pmod{4}$ a prime
We construct several cyclic $(v;k_1,k_2,k_3;\lambda)$ difference families with $v\equiv3 \pmod{4}$ a prime and $\lambda=k_1+k_2+k_3-(3v-1)/4$. Such families can be used in conjunction with theExpand
PAF Reconstruction with the Orbits Method
TLDR
A method for reconstructing a special class of \(-1/{+1}\) sequences is proposed by making use of some combinatorial properties of PAF values and the orbits method based on group actions and additional filtering criteria are applied to enhance the effectiveness of the method. Expand
New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59
TLDR
Two new circlulant D -optimal designs of order 118 are given, which are of Ehlich's type, and new skew-Hadamard matrices of order 236 = 4 · 59 are also constructed for the first time. Expand
New Results on D-Optimal Matrices
We construct a number of new supplementary difference sets (SDS) with v odd and . In particular, these give rise to D-optimal matrices of the four new orders 206, 242, 262, 482, constructed here forExpand
...
1
2
...

References

SHOWING 1-10 OF 36 REFERENCES
On supplementary difference sets
Given a finite abelian group V and subsets S1, S2, ... ,Sn of V, write Ti for the totality of all the possible differences between elements of Si (with repetitions counted multiply) and T for theExpand
Some remarks on supplementary difference sets
Let S1,S2 ,... ,Sn be subsets of V, a finite abelian group of order v written in additive notation, containing k1 k2,... ,kn elements respectively. Write Ti for the totality of all differencesExpand
A note on supplementary difference sets
Let S1, S2,···, Sn be subsets of G, a finite abelian group of order v, containing k1, k2,...,kn elements respectively. Write Ti for the totality of all differences between elements of Si (withExpand
Supplementary difference sets and optimal designs
Abstract D-optimal designs of order n = 2 v ≡ 2 (mod 4), where q is a prime power and v = q2 + q + 1 are constructed using two methods, one with supplementary difference sets and the other usingExpand
Supplementary difference sets and D-optimal designs for n == 2 mod 4
Supplementary difference sets 2{12n; k, r; λ} are used to construct D-optimal designs for n ≡ 2 mod 4, where k, r, λ are defined through n. A number of new designs is constructed. The D-optimalExpand
Maximal binary matrices and sum of two squares
A maximal (+1, — l)-matrix of order 66 is constructed by a method of matching two finite sequences. This method also produced many new designs for maximal (+1, -l)-matrices of order 42 and newExpand
Some Designs for Maximal (+1, -1)-Determinant of Order n ≡2 (mod 4)
(ii) matrices Mn of the maximal nth order ( + 1, — 1 )-determinant whose absolute value equals u„1/2 exist for n ^ 38, provided that "(n — 1, —l)p = 1 (Hubert's symbol) for any prime p," which isExpand
On Designs of Maximal (+1, -1)-Matrices of Order n ≡2 (mod 4). II
0(A) = AAT = (an), G(B) = BB* = (6,-,-), 1 Û i, j Û n/2; where an = í>,-¿ = n/2, for 1 ^ i ^ n/2, and a<y + fc.y = 2 for i í¿ j. Since A, 5 are circulant (+1, — l)-matrices, it can be shown easilyExpand
The Non-equivalent Circulant D-Optimal Designs for n=2 mod 4, n<=54, n=66
Abstract All non-equivalent circulant D-optimal designs for n ≡ 2 mod 4, n ⩽ 54 and n = 66 are given and were found by an exhaustive search. There is a unique non-equivalent circulant design for eachExpand
The non-equivalent circulant D-optimal designs for n = 90
An exhaustive search was carried out to find all 1358 non-equivalent circulant D-optimal designs for n = 90. A sample of 30 of these designs, presented in a table in the form of the correspondingExpand
...
1
2
3
4
...