Journal of Statistical Planning and

Inference 81 (1999) 183193

www.elsevier.com/locate/jspi
Construction of three-level supersaturated design
Shu Yamada

, Yoshiko T. Ikebe, Hiroki Hashiguchi, Naoto Niki

Department of Management Science, Science University of Tokyo, Kagurazaka 1-3, Shinjuku, Tokyo
162-8601, Japan
Received 4 December 1997; accepted 22 December 1998
Abstract
Supersaturated design is one type of fractional factorial design where the number of columns is
greater than the number of rows. This type of design would be useful when costs of experiments
are expensive and the number of factors is large, and there is a limitation on the number of runs.
This paper presents some theorems on three-level supersaturated design and their application to
construction. The construction methods proposed in this paper can be regarded as an extension
of the methods developed for two-level supersaturated designs. c 1999 Elsevier Science B.V.
All rights reserved.
MSC: primary 62K15; secondary 05B20
Keywords:
2
statistic; Design of experiments; Measure of dependency; Orthogonal;
Permutation of rows
1. Introduction
In experimental studies, when costs of experiments are expensive and the number
of factors is large, ordinary techniques are not applicable, due to the limitation on
the number of experimental runs. One approach in such a situation is application of
supersaturated designs under the eect sparsity assumption, that implies only a few
dominant factors actually aect the response. Supersaturated design is a fractional facto-
rial design in which the number of factors is greater than the number of experimental
runs. Some practical applications of supersaturated design are shown in Lin (1993,
1995) and Wu (1993).
Supersaturated design was introduced by Satterthwaite (1959), who derived a random
balance supersaturated design. One of the earliest systematic construction of supersat-
urated designs is that due to Booth and Cox (1962). In their construction, a number
of initial columns are generated, then additional columns are added sequentially, while

Corresponding author. Tel.: +81-3-3260-4271, ext 3336; fax: +81-3-3235-6479.

E-mail address: shu@ms.kagu.sut.ac.jp (S. Yamada)
0378-3758/99/$ - see front matter c 1999 Elsevier Science B.V. All rights reserved.
PII: S0378- 3758( 99) 00007- 5
184 S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193
avoiding the creation of large values of squared inner products between two columns
of the design. By employing computer search, seven supersaturated designs have been
obtained in this manner. Recently, Lin (1993) has proposed a method of construction
for supersaturated designs via half fractions of Plackett and Burman (1946) design.
Wu (1993) has proposed supersaturated designs by adding the cross products of two
columns in the Plackett and Burman design. Iida (1994) has obtained some mathemati-
cal background on the addition of the cross products in the Plackett and Burman design.
Lin (1995) has examined the maximum number of columns that can be accommodated
when the degree of nonorthogonality is specied by computer search. Nguyen (1996)
described a method of constructing supersaturated designs from balanced incomplete
block designs. Tang and Wu (1997) have shown a method for constructing supersatu-
rated designs while considering the average squared inner products. Li and Wu (1997)
have developed columnwise-pairwise algorithms to construct supersaturated designs.
Yamada and Lin (1997) have given a new class of supersaturated design including an
orthogonal base.
As regarding two-level supersaturated design, there are some construction methods
as follows: (a) Computer search: Booth and Cox (1962), Lin (1991), Lin (1995), Li
and Wu (1997); (b) Exploration from previous two-level designs, e.g., half fraction of
Plackett and Burman design: Lin (1993), Wu (1993), Iida (1994), Yamada and Lin
(1997); (c) Sequential generation of columns by permutation of rows on the initial
matrix: Tang and Wu (1997).
As opposed to most of the existing literature, which considers two-level supersatu-
rated designs, Yamada and Lin (1998) have shown a new class of three-level super-
saturated design, i.e., the number of columns are greater than the number of rows and
each column consists of three levels, such as 1, 2 and 3. The criteria on the dependency
between two columns are derived by an analogy from hypothesis testing statistic on the
two-way contingency table. Furthermore, a construction method which can be regarded
as type (b) is shown. They give three-level supersaturated designs with 24, 36 and
48 rows. This paper rst discusses some theorems on three-level supersaturated design
similar to those on the previous two-level supersaturated designs. A method for con-
struction of three-level supersaturated design is described base on the theorems, where
the construction method can be regarded as an extension of Tang and Wus (1997)
approach to three-level supersaturated design. Constructions based on the theorems and
evaluation of the constructed designs are demonstrated.
2. Theorems on three-level supersaturated design
Let N be a multiple of three and D
N
be the set of N-dimensional vectors consisting
of equal numbers of 1s, 2s and 3s. For d
1
; d
2
; : : : ; d
K
D
N
, the N K matrix
D = [d
1
; d
2
; : : : ; d
K
] (1)
S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193 185
is called a three-level design. The usual denition of two-level supersaturated design
is that the number of the columns is greater than or equal to the number of rows. It
implies that it is impossible to estimate all factor eects under this relationship between
the numbers of rows and columns (for example Tang and Wu (1997)). In case of
three-level design, it is impossible to estimate the all factor eects if 2K 1 N. We
call D a three-level supersaturated design if 2K 1 N under consideration of the
impossibility of estimation.
1
Yamada and Lin (1998) have dened a measure for dependency between two columns
d; e D
N
by

2
(d; e) =

a;b=1;2;3
(n
ab
N=9)
2
N=9
; (2)
where n
ab
is the number of rows whose values are [a; b] in the N 2 matrix [d; e].
Two vectors d; e D
N
are said to be independent if
2
(d; e) = 0. Furthermore, they
have dened the design criteria of dependency of a whole design D = [d
1
; : : : ; d
K
] by
ave

2
(D) =

16ij6K

2
(d
i
; d
j
)
__
K
2
_
; (3)
max

2
(D) = max
16ij6K

2
(d
i
; d
j
): (4)
The construction of three-level supersaturated design can be described as the selection
of vectors from the set D
N
by a reasonable rule. The following lemma can be regarded
as a special case for the theorem on the multi-level orthogonal design, proven by Niki
et al. (1997), and it is useful to construct initial matrices in three-level supersaturated
designs.
Lemma 1.
1. If N is a power of three; then the maximum number of mutually independent
vectors in D
N
is (N 1)=2.
2. Let d
1
; : : : ; d
(N1)=2
be mutually independent vectors; then it holds that
(N1)=2

i=1

2
(d
i
; d) = 2N (5)
for any d D
N
.
By using this lemma, we may prove the next three theorems.
Theorem 1. Let N be a power of three and let D
1
be an N L matrix consisting
of L = (N 1)=2 mutually independent column vectors. Suppose that the matrices
D
2
; D
3
; : : : ; D
M
are generated by permutations of rows on D
1
; and consider the N
(ML) matrix:

D = [D
1
D
2
D
M
]: (6)
1
This denition of three-level supersaturated design is due to a useful comment given by a referee.
186 S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193
Then the average
2
values on the design

D is
ave

2
(

D) =
4N(M 1)
M(N 1) 2
; (7)
regardless of the permutation rule.
Proof. Write

D = [D
1
D
2
D
M
] = [d
11
; : : : ; d
1L
; d
21
; : : : ; d
2L
; : : : ; d
M1
; : : : ; d
ML
] (8)
then, from the independence of the ds and Lemma 1, the sum of
2
values of all
pairs between two columns in

D is
ave

2
(

D)
_
ML
2
_
=
M

m=1

16ij6L

2
(d
mi
; d
mj
) +

16mm

6M

16i; j6L

2
(d
mi
; d
m

j
)
=

16mm

6M

16i; j6L

2
(d
mi
; d
m

j
) (9)
=
MN(M 1)(N 1)
2
; (10)
which completes the proof.
Theorem 2. Let N be a power of three. Then; there exists no three-level supersatu-
rated design which contains (N 1)=2 mutually independent columns and satises
max

2
(D)
4N
N 1
: (11)
Proof. Suppose that there exists a three-level supersaturated design which contains
L = (N 1)=2 mutually independent columns and satises Eq. (11), say D = [d
1
; : : : ;
d
L
; d
L+1
; : : : ; d
K
]. Without loss of generality, assume that d
1
; : : : ; d
L
are mutually inde-
pendent. Since max

2 (D) is less than 4N=(N 1), the sum of the

2
values between
any d D
N
and d
i
is
L

i=1

2
(d
i
; d)
N 1
2
4N
N 1
= 2N: (12)
The right-hand side and Eq. (5) contradict each other and the theorem is proved.
Theorem 3. Given a three-level (supersaturated) design D = [d
1
; d
2
; : : : ; d
k
] with N
rows; let
+
(D) be the matrix obtained from D by transforming all 1s to 2s; all
2s to 3s and all 3s to 1s; similarly; let

(D) be the matrix obtained from D by

transforming all 1s to 3s; all 2s to 1s and all 3s to 2s (note that all columns of
+
(D)
and

(D) belong to D
N
). Next; by using these matrices; construct the three-level
supersaturated designs D

and

D by
D

=
_
D D D
D
+
(D)

(D)
_
; (13)
S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193 187

D =
_
_
1 D D D
2 D
+
(D)

(D)
3 D

(D)
+
(D)
_
_
; (14)
where 1; 2 and 3 are column vectors of 1s; 2s and 3s; respectively. Then the maximum
values on these designs are
max

2
(D

) = max
_
N; 2 max

2
(D)
_
; (15)
max

2
(

D) = 3 max

2
(D): (16)
Proof. We put
D

=
_
D D D
D
+
(D)

(D)
_
= [d

11
; : : : ; d

1k
; : : : ; d

31
; : : : d

3k
]; (17)

D =
_
_
1 D D D
2 D
+
(D)

(D)
3 D

(D)
+
(D)
_
_
= [

d
0
;

d
11
; : : : ;

d
1k
; : : : ;

d
31
; : : : ;

d
3k
]: (18)
If m = m

, then the relations

2
(d

mi
; d

i
) = N (m = m

); (19)

2
(d

mi
; d

mj
)62
2
(d
i
; d
j
) (i = j); (20)

2
(d

mi
; d

j
)62
2
(d
i
; d
j
) (m = m

; i = j) (21)
can be derived straightforwardly by calculating the
2
value proving Eq. (15). Further-
more,

2
(

d
0
;

d
mi
) = 0; (22)

2
(

d
mi
;

d
m

i
) = 0 (m = m

); (23)

2
(

d
mi
;

d
mj
)63
2
(d
i
; d
j
) (i = j); (24)

2
(

d
mi
;

d
m

j
)63
2
(d
i
; d
j
) (m = m

; i = j) (25)
can be derived in a similar way, verifying Eq. (16).
Remark. We now summarize the relationship between the theorems on two-level and
three-level supersaturated designs. As regarding two-level supersaturated designs, Tang
and Wu (1997) have proposed the following construction algorithm:
188 S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193
1. An N-dimensional orthogonal base, consisting of a set of N 1 vectors, is selected
from the set of two-level equal occurrence vectors, where a two-level equal occur-
rence vector is a vector in which the number of occurrences at one level is equal
to the number of occurrences at another level. The base is used as an initial matrix.
2. Some designs are generated sequentially by permutations of the rows of the initial
matrix.
This algorithm is justied by the fact that the criterion for the average squared inner
product does not depend on the permutation rule. Hence, by specifying the average
squared inner product to a given level, two-level supersaturated designs may be derived
by this algorithm. Theorem 1 can be regarded as an extension of the theorem on
two-level supersaturated designs, obtained by Tang and Wu (1997), to three-level.
Furthermore, Yamada and Lin (1997) has obtained a method to generate two-level
supersaturated designs with N = 2n rows and K = 2k + 1 columns from a two-level
supersaturated design with n rows and k columns, when the maximum squared inner
product on the generated design is equal to a pre-specied level. Theorems 2 and 3
can be regarded as an extension of Yamada and Lin (1997). The theorems shown in
this paper imply that three-level supersaturated designs can be constructed in a similar
way to the constructions of two-level supersaturated designs.
3. Construction of three-level supersaturated designs
3.1. Example: N = 9
Theorem 1 ensures that three-level supersaturated designs can be generated by per-
mutation of an initial three-level design while keeping ave

2 (D) at a pre-specied level.

Furthermore, Theorem 2 indicates that there does not exist a three-level supersaturated
design such that max

2 (D)64 for N =9, where it includes four mutually independent

columns. Table 1 shows all possible variations of
2
values for N = 9 and D. This
table was obtained by a brute force examination of all possible combinations of two
three-level columns. A three-level supersaturated design which satises max

2 (D) = 6
Table 1
Variations of
2
values
N Variations
9 0, 4, 6, 10, 18
18 0, 2, 3, 5, 6, 8, 9, 11, 12, 14, 17, 18
20, 21, 26, 36
27 0, 1
1
3
; 2, 3
1
3
; 4, 5
1
3
; 6, 7
1
3
; 8, 9
1
3
10, 11
1
3
; 12, 13
1
3
; 14, 15
1
3
; 16, 17
1
3
; 18, 19
1
3
20, 21
1
3
; 23
1
3
; 24, 26, 27
1
3
; 29
1
3
;
30, 33
1
3
; 35
1
3
; 38, 43
1
3
; 54
S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193 189
Table 2
A permutation rule to construct the design with N = 9 and K = 20:
max

2 (D) = 6
D
1
D
2
D
3
D
4
D
5
1 1 1 1 1
2 7 9 6 7
3 9 6 7 9
4 8 7 8 3
5 6 8 9 8
6 5 5 3 6
7 4 3 5 5
8 3 4 4 4
9 2 2 2 2
is explored since
2
= 6 is the next to 4 in Table 1. Specically, the 9 4 matrix:
D
1
=
_

_
1 1 1 1
1 2 2 2
1 3 3 3
2 1 2 3
2 2 3 1
2 3 1 2
3 1 3 2
3 2 1 3
3 3 2 1
_

_
(26)
was utilized as an initial matrix for the construction. The matrices D
2
; D
3
; : : : were gen-
erated sequentially by permutations of the rows on the initial matrix, where a permuted
matrix D
j
is added if the maximum
2
value with each previous column is less than
or equal to 6. Finally a three-level supersaturated design D = [D
1
; D
2
; : : : ; D
K
] which
satises max

2 (D) =6 was constructed. Table 2 shows the permuted orders on the ini-
tial matrix. The table was derived by an examination of all permutations on the rows
(9!=362 880). Specically, all columns are examined in some order, so, there is a pos-
sibility to explore other combinations of columns by other orders. For example, the sec-
ond column in Table 2 indicates that D
2
was constructed by the permutation as follows:
1st row to 1st row, 2nd row to 7th row, 3rd row to 9th row, : : :, 9th row to 2nd row.
Furthermore, a three-level supersaturated design such that max

2 (D) = 10 was ex-

plored by a similar computer search which examines all permutations of rows. Table 3
shows the permutations on the initial matrix. A three-level supersaturated design with
9 rows and 220 columns is generated from this table.
3.2. Example: N = 18 and 27
Theorem 3 was applied to construct a three-level supersaturated design because there
are too many permutations (18! 6 10
15
) to employ a computer search similar to
the case N =9. A three-level supersaturated design with 18 rows and 60 columns was
190 S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193
Table 3
A permutation rule to construct the design with N = 9 and K = 220: max

2 (D) = 10
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
3 3 3 3 3 3 3 3 3 3 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 3 3 3 3 3
5 5 5 5 7 7 7 7 7 8 5 5 5 5 7
6 7 7 7 6 6 6 8 8 9 6 7 8 8 5
7 6 8 9 5 8 9 6 9 5 8 9 6 7 6
8 9 6 8 9 5 8 9 5 6 9 6 7 9 8
9 8 9 6 8 9 5 5 6 7 7 8 9 6 9
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
3 3 3 3 3 5 5 5 5 5 5 5 5 5 5
7 7 7 8 8 3 3 3 3 6 6 6 6 8 8
5 8 9 6 7 6 8 9 9 3 7 7 7 6 6
8 9 5 7 5 7 9 6 8 8 3 8 9 3 9
9 6 6 5 9 8 7 7 6 7 8 9 3 9 7
6 5 8 9 6 9 6 8 7 9 9 3 8 7 3
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
5 5 6 6 6 6 6 6 7 7 7 7 7 7 8
8 9 7 7 8 9 9 9 6 6 6 9 9 9 3
9 6 3 3 7 3 7 8 5 9 9 3 5 5 5
7 7 5 9 3 7 5 3 9 3 8 5 6 8 6
3 3 8 5 5 8 3 7 8 8 5 6 3 6 9
6 8 9 8 9 5 8 5 3 5 3 8 8 3 7
46 47 48 49 50 51 52 53 54 55
1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2
4 4 4 4 4 4 4 4 4 4
8 8 8 9 9 9 9 9 9 9
7 7 7 3 3 3 3 6 6 8
9 9 9 6 7 7 8 3 8 3
3 5 6 8 5 6 7 5 3 6
6 3 5 7 8 5 5 8 5 7
5 6 3 5 6 8 6 7 7 5
generated by substituting the supersaturated design with 9 rows and 20 columns into
Eq. (17). In this design, the maximum dependency on the generated supersaturated
design is assured to be 12 because max

2 (D

) = 12 by Theorem 3.
A three-level supersaturated design with 27 rows and 61 columns was generated by
Theorem 3 from a supersaturated design with 9 rows and 20 columns. In this case, the
maximum dependency on the design is 18.
S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193 191
The supersaturated design with 9 rows and 220 columns whose permutations are
shown in Table 3 may also be used to construct three-level supersaturated designs
with 18 or 27 rows. In the generation of designs with 18 rows and 660 columns,
Theorem 3 assures that max

2 (D

)=20, and in designs with 27 rows and 661 columns,

max

2 (

D) = 30:
3.3. Evaluation of dependency in the design
1. There are 190 pairs of two columns in the three-level supersaturated design with 9
rows and 20 columns. The frequency of the
2
values is shown in Table 4. Table 4
also shows the frequency of
2
values on the three-level supersaturated design with
9 rows and 220 columns. By a comparison between the designs with 20 columns and
220 columns, the design with 220 columns is more ecient in terms of the number
of columns although the maximum and average dependencies between columns is
strong.
In the design with 220 columns, the maximum value of
2
is 10 and the frequency
of
2
(d
i
; d
j
) =10 to the total is around 10%, so the proportion may not be so high.
This can be explained by the following reason. Let us consider d
1
; : : : ; d
4
; these are
mutually independent columns. Eq. (5) implies that when a vector d has the relation

2
(d; d
1
) = 10, the
2
values with the other columns are {4; 4; 0} from Table 1.
2. Consider the comparison on the designs where the numbers of rows are dierent,
such as comparison between designs with 9 and 18 rows. Since the number of
rows N aects
2
, a direct comparison of the frequency would be inadequate. Eq.
(5) shows that the sum of the
2
values of independent columns are 2N, so
2
=N
would be a measure for the dependency between two columns standardized by N.
Of course, this is an index for the comparison of the dierent size of designs, but
it would be acceptable as an initial method for comparison. For example,
2
= 6
in the design with N = 9 rows corresponds to
2
= 12 in the design with N = 18
rows in terms of the standardized dependency. Table 5 shows the frequency of the
standardized measure
2
=N for the designs with 9; 18 and 27 rows.
3. Fig. 1 demonstrates the proportion based on the frequency of
2
=N on the designs
with 9; 18 and 27 rows. From this gure and Table 5, the design with 27 rows is
Table 4
Frequency of
2
on the designs with N = 9 rows
N K
_
K
2
_

2
0 4 6 10 max ave
9 20 190 32 114 44 6 3.79
17 60 23
9 220 24090 3152 13972 4657 2309 10 4.43
13 58 19 10
Note: Upper: frequency, Lower: percentage (%).
192 S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193
Table 5
Frequency of the standardized dependency:
2
=N on the designs with N = 9, 18 and 27 rows
N K
_
K
2
_

2
=N
2
0/18 2/18 3/18 4/18 5/18 8/18 9/18 12/18 Max. Ave.
9 20 190 32 114 44 6 3.79
17 60 23
18 60 1770 288 456 264 456 114 60 132 12 3.97
17 26 15 26 6 4 7
27 61 1830 1128 456 114 132 18 3.54
62 25 6 7
Note: Upper: frequency, Lower: percentage (%).
Fig. 1. Proportions of the frequencies on
2
=N in the designs with N= 9, 18 and 27 rows.
the most ecient in terms of the standardized dependency since the most of the
pairs concentrate low level of
2
=N, e.g. 87% of the pairs appear up to
2
=N =4=18.
4. Concluding remarks
This paper shows some theorems on three-level supersaturated design and their ap-
plications to construction. Some three-level supersaturated designs with 9 rows are
derived by the sequential addition of matrices constructed by permutations of rows
on the initial matrix, because the average dependency between two columns does not
depend on the permutation rule. Here the maximum dependencies on two columns in
the designs are equal to some pre-specied levels.
In the cases of row sizes N =18 and 27; it is impossible to apply similar computer
search methods, so a construction method is demonstrated. Specically, the method
generates three-level supersaturated designs with 18 and 27 rows from a design with 9
S. Yamada et al. / Journal of Statistical Planning and Inference 81 (1999) 183193 193
rows. Here, the maximum dependencies between two columns are also equal to some
pre-specied level.
The construction methods can be regarded as an extension of the methods devel-
oped for two-level supersaturated designs. The existence of the correspondence between
three-level and two-level designs would be one of the main results of this paper.
However, this paper considers only the construction of designs. As regarding the data
analysis, stepwise regression is usually applied to analyze data collected by two-level
supersaturated design (Lin, 1993,1995). In the case of three-level supersaturated design,
stepwise regression would be also acceptable as well as the case of two-level super-
saturated design, where each of three-level columns is transformed to some columns
constructed by dummy variables. According to the analysis, an estimate of the ef-
fect of a factor is independent to an estimate of the eect of another factor when
2
value between two columns is equal to 0. On the other hand, the two estimates are
completely dependent when
2
= 2N. Intuitively, the two estimates assigned to two
dierent three-level columns would be nearly independent when the
2
value is close
to 0. More detailed discussion on analysis of data collected by the proposed three-level
supersaturated design is a problem for future research.
Acknowledgements
We express sincere thanks to the editor, associate editor and two anonymous referees,
each of whom made valuable comments that helped us to improve this article.
References
Booth, K.H.V., Cox, D.R., 1962. Some systematic supersaturated designs. Technometrics 4, 489495.
Iida, T., 1994. A construction method of two level supersaturated design derived from L12. Jpn. J. Appl.
Statist. 23, 147153 (in Japanese).
Li, W.W., Wu, C.F.J., 1997. Columnwise-pairwise algorithms with applications to the construction of
supersaturated designs. Technometrics 39, 171179.
Lin, D.K.J., 1993. A new class of supersaturated designs. Technometrics 35, 2831.
Lin, D.K.J., 1995. Generating systematic supersaturated designs. Technometrics 37, 213225.
Niki, N., Hashiguchi, H., Yamada, S., Ikebe, Y.T., 1997. Three theorems on multi-level orthogonal design
(in preparation).
Nguyen, N.K., 1996. An algorithm approach to constructing supersaturated designs. Technometrics 38, 6973.
Plackett, R.L., Burman, J.P., 1946. The design of optimum multifactorial experiments. Biometrika 33,
303325.
Satterthwaite, F.E., 1959. Random balance experimentation (with discussions). Technometrics 1, 111137.
Tang, B., Wu, C.F.J., 1997. A method for constructing supersaturated designs and its E(s
2
) optimality.
Canadian J. Statist. 25, 191201.
Wu, C.F.J., 1993. Construction of supersaturated designs through partially aliased interactions. Biometrika
80, 661669.
Yamada, S., Lin, D.K.J., 1997. Supersaturated design including an orthogonal base. Canadian J. Statist. 25,
203213.
Yamada, S., Lin, D.J.K., 1998. Three-level supersaturated design. Submitted for publication.