A Technique to Construct Linear Trend Free Fractional Factorial Design Using

Some Linear Codes

1
Poonam singh .
Department of Statistics, University of Delhi,
Email: pbs_93@yahoo.co.in

2
Puja Thapliyal
Department of Statistics, University of Delhi
Email: pujathapliyal98@gmail.com
3
Veena Budhraja
Department of Statistics, Sri Venkateswara College,
University of Delhi
Email: :veena_budhraja@yahoo.co.in

Abstract

A method for constructing trend free fractional factorial design using parity check matrix of a linear code is developed.
The Method provides a systematic approach to construct fractional and blocked fractional factorial designs with trend
free main effects and some two factor interactions.

KEYWORDS: Time count , Linear Codes, Reed Muller Codes, BCH codes

1. INTRODUCTION

Fractional Factorial experiments, especially those of exploratory type are often conducted sequentially
in a specific run order. In some situations, the experimentation scheme may suffer from some
undesirable effects of factors. For instance, in many industrial and agricultural experiments, treatments
are applied to experimental units sequentially in time or space, where there may be unknown or
uncontrollable variables influencing the experimental process that are highly correlated with the order
in which the observations are obtained.

2
corresponding author: Puja Thapliyal
Email id: pujathapliyal98@gmail.com

1
Hence, the treatments which are not being influenced by the effect of the trend under study is required.
Such type of designs are known as trend free designs. The need of trend free designs was mentioned
by Joiner and Campbell(1976) who described an experiment in which the measurement drift with time
due to the build up of carbon in a spectrophotometer and also by Freeny and Lai(1997), in an
experiment taken from the electronic industry in which a photolithographic polisher showed the
tendency drift lower through time .
The study of trend free designs was begun by Cox(1951) and has been addressed by different authors
like Hill(1960), Daniel and Wilcoxon(1966), Draper and Stoneman(1968), for the construction of
trend free design. The important work of Daniel and Wilcoxon(1966) was on constructing trend
resistant contrasts for 2n design and using the contrasts to generate a new run order. Cheng and
Jacroux(1988) generalised Daniel and Wilcoxon work for 2n designs. Coster and Cheng(1988)
introduced a generalized foldover method for constructing trend free run order from a sequence of
generators in a simple manner. Further, Bailey, Cheng and Kipnis (1992) extended the method to
general symmetric and asymmetrical factorial designs. Recently Hilow(2012) developed an
assignment procedures of constructing minimum cost trend free two level fractional factorial designs.
In this article, we present a method to construct the generator matrix for the required designs using
the parity check matrix of a linear code. Section 2 gives the preliminaries required. A brief
introduction of coding theory is given in section 3. Section 4 presents the construction technique to
generate the designs. A method using some linear codes is described and illustrated through examples
in section 5 . The section 6 presents the construction for trend free blocked fractional factorial
designs using the linear codes, mentioned in previous section.

2.Preliminaries
Fractional factorial Design: Let D = (qrn-p) denote a q-p fraction of the qn factorial design in qr
incomplete blocks. Let N = qn-p be the number of treatment combinations, K=qn-p-r be the size of each
block and B = qr be the number of blocks.The linear model for the qn factorial design is given as
|1|

2
Where y is the N 1 column vector of observations , X is the N n design matrix of known constants;

is the n1 column vector of regression coefficients and e is the N1 column vector of random errors

with zero means and variance 2.. When block effects are considered, the model is changed to

|2|

with B= is NB block matrix with block size K and is the corresponding (K 1) block

parameter.

Definition1: Let denotes the ordered vector of observations,

for x = 0,1,2,... be the N 1 vector of trend coefficients and let ui be the

contrast for main effect Ai ; i=1,2,...n, in the run order. Then the quantity is known as the time

count for the main effect Ai ..

A necessary and sufficient condition for a main effect contrast u to be trend free is that

(1.1)

In general, an N 1 vector u is called trend free if (1.1) holds.

When the assumption of trend effect of different factors of the design is also considered, then this
assumption changes the model |2| to

3
 |3|

Where , t is the (K 1) linear vector and is the trend effect coefficient.The model is a

linear model for factorial designs with trend. The first K rows of correspond to K

treatment combinations in the principal block, the next K rows to the treatment combinations in the
second block and so on.

Definition 2: A run order is optimal for the estimation of the factor effects of interest in the presence
of nuisance v-degree polynomial trend iff

(1.2)

Where is an Nn matrix of factor effect coefficients and T is the Nv matrix of polynomial

trend coefficients. If (1.2) is satisfied then the run order is said to be v-trend free. If x is any
column of nd t is any column of T then the usual inner product is the time count between

x and t. Criterion given in eq. (1.2) states that all the time count are zero for optimal run order.

Coster and Cheng(1988) introduced Generalised Foldover Scheme to generate systematic run order for
full and fractional factorial plans . We give here the definition of Generalised Foldover Scheme{Coster
and Cheng(1988)}.

Definition 3: Generalised Foldover Scheme (GFS): For a factorial design D= (qrn-p) with n factors
A1, A2,..An let G be the generator matrix of design given by

4
Let be a 1n matrix of zeros. Then the run order of design D is produced by the GFS with respect to

the generator sequence is given by where

for i = 1,2,,n-p. In the run order , the principal block consists of the first qn-p-r runs; the second
block consist of the next qn-p-r runs, and so on. For a factorial design D1=(qrn-p), let be the

n factors and G be the generator matrix of design D1 given by

Coster and Cheng(1988) derived following conditions for -trend free effects in GFS. These conditions

involve the generator matrix.

1. The main effect of a given factor is trend free if the corresponding letter appears at least ( +1)

times in the generator sequence.

2. A 2-factor interaction is -trend free if and only if there are at least ( +1) generator each of

which exactly oneof the two factors appears at non-zero level.

For linear trend free design, the above conditions can be described in the following properties:
5
Property 1: For any factor , if there are at least two non zero elements , then all the

main effect components of factor are linear trend free.

Property 2: For any factor ,if there are at least two pairs

, such that one element is zero and the other element is non zero, then all

components of the interaction are linear trend free.

3. Linear codes

A linear [n,k,d]q code C over GF(q), where q is prime or prime power, n is the length, k is the

dimension and d is the minimum distance, is a k-dimensional subspace of the n-dimensional vector

space V(n,q) over GF(q). The dual code C of an [n,k,d]q code C is C = { v V(n,q)/ v.w=0 for all

w C}.

This is an [n, n-k, d]q code and an (n-k) n generator matrix H of C is called a parity check matrix

of C. If the generator matrix is given in the standard form, a corresponding parity check matrix is given

as

T
H = [ A In k ]

Any d-1 columns in generator matrix G of C are linearly independent and any d-1 columns in parity

check matrix H are linearly independent.

4. Factorial Designs with some Linear Trend Free Effects

GFS provides a technique to construct linear trend free factional factorial designs using generator

6
 matrix, but there is no general method to construct the generator matrix. We use the parity check

matrix of a linear [n,k,d]qcode to obtain the set of generators to construct the desired designs.

Method of Construction

1. Consider the parity check matrix Hn-kn of a linear [n,k,d]q code.

2. Partition the matrix H in two submatrix F1 and F2, where F2 consists of the vectors with weight (w)

one.

3. Let m denotes the number of columns in F2. If m <d-1, then select any d-1 columns from H to form

a matrix M of order n-k d-1 otherwise select M such that there is at least one column from F2. The

order of M is n-k d-1.

4. Write the transpose of M and the transpose be denoted by MT of order (d-1n-k). Delete the column

with all zero entries and repeated columns to form the matrix G of order ,say (d-1)l

5. Retain G , if the number of columns (l ) in G>d-1 Otherwise go to step 3.

6. Apply GFS on G to obtain the fractional factorialdesign ql-r; where 1 r (n-k)-(d-1) &

(d-1)+1 l n-k . The resultant fractional factorial designis such that some of the main effects and

two factor interactions are linear trend free.

Remark :
1. The total number of possible choices of M matrices is

2. In case d-1 = l in step 5, we get the full factorial design ql with some main effects and two factor
interactions Linear trend free.
3. The design of trend freeness of the factors depends upon the weight (w) of the corresponding
column in G.

7
 4. All the main effects will be trend free if the weight(w) of all columns in G is at least two.

Above method of construction can be summarized in following theorem

Theorem 1: Existence of a linear [n, k, d]q code implies the existence of ql-r {1 r (n-k)-(d-1) & (d-
1)+1 l n-k },fractional factorial design and ql ( l=d-1) full factorial design in which all main effects
and some of the two-factor interactions are linear trend free, where (d-1) is number of linearly
independent columns in matrix H and l is the number of factors/columns in G.

5. Linear Trend Free Fractional Factorial Designs using different Codes

We consider different types of linear codes and generate linear trend free fractional factorial designs

using the method of construction described in previous section. For details see Hedayat et.al (1999).

a) Reed Muller Codes

The rth order binary Reed-Muller code R(r,a) of length n = 2a, for 0 r a, is the set of all vectors f,

where f(i1,..ia) is a Boolean function which is a polynomial of degree at most r. For any a and any r,

0 r a, there is a binary rth order RM code R(r,a) with the following properties:

Length n = 2a, dimension k = ++ and minimum distance 2a-r . The parity check matrix of

R(r,a) code is the generator matrixof its dual code. The dual of RM(r,a) is RM(a-r-1,a) code.
Example 1: Consider a parity check matrix of RM(2,4)

H=

8
Any three columns in parity check matrix H matrix are linearly independent. Here d-1=3, and m =5

(in F2) and we get the designs and corresponding generator matrices depending on the columns

selected. According to the selection of columns ,we have the following cases :

i) 11 columns with none of the column having weight one and there are possible ways of

selection where none of the column is with weight (w)oneand the corresponding factorial designs will

have all main effects linear trend free. All generated matrices and the table contains generator

matrices, their corresponding designs, trend free effects and defining relations are available with th

authors.

ii) For m=5 and d-1=3, n-m=11.The possible choices of columns selected for generator matrix are

+ + . Suppose we choose the three columns 4th, 5th and 6th to form the matrix

MRM =

On transposing we get matrix as

GRM

9
in which all three rows d-1 =3 are independent. here d-1 =3 and l=5, Using the method of GFS on

generator matrix we get a resolution III, fractional factorial design with defining relation

I =A1A3A5 = A1A2A3A4= A2A4A5 and is given in table 1. Using the properties 1and 2 we observe

that main effect component of A1, A3, A5 and the two factor interaction A1A2, A1A3 and A2A4 and

A3A4 are linear trend free.

Table 1:25-2 fractional factorial design with Time count

A1 A2 A3 A4 A5
0 0 0 0 0
1 0 0 1 1
0 1 1 0 1
1 1 1 1 0
1 0 1 0 1
0 0 1 1 0
1 1 0 0 0
0 1 0 1 1
T
0 8 0 4 0
c

b) Cyclic Codes

A linear code over GF(q) is said to be cyclic if whenever (c0,c1,..,cn-2,cn-1) is a codeword so also is

(c1,c2,..,cn-1,c0). Cyclic arrays can be described by a single generating vector z = ( z0z1.zn-1 )

such that the generator matrix consists of this vector and its first ( k-1 ) cyclic shifts. The generating

vector z is represented by a polynomial z(x) = z0 + z1X + +zn-1Xn-1 which is called a generator

polynomial for the code. If a code is cyclic, so is its dual, and the generator polynomial of its dual

can be obtained by the following result given in Macwilliam and Sloane (1977).
10
Theorem 2: If C is a cyclic code of length n over GF(q), with generator polynomial z(x), then the dual

code C is also cyclic and has generator polynomial

deg.z -1
where z*(x) = X z(x ) is reciprocal polynomial to z(x).

Example 2: Let = be the generator

polynomial for [15,7,5]2 code. Then the generator polynomial for the dual of this code is given as
h (x) = x7( 1+ x-4+x-6+x-7) = 1+x+x3+x7
Hence the parity check matrix of [15,7,5]2 code is obtained by writing the coefficients and giving the

cyclic shift to the coefficients, as given below

Hcy =

Any four columns in the H matrix are linearly independent, d-1 = 4 and m=5, n-m= 15-5 = 10

column with none of them of weight(w) one. Then , there are 210 possible selection of such sets of

columns from the matrix H. Following the method of construction, we generated all generator matrices

from the set of selected columns and listed corresponding fractional factorial designs with their trend

free effects and defining relations {available with the authors}.The result of selecting columns 4th, 5th,

6th and 7th gives the matrix Mcy(84)

11
 Mcy(84=

Deleting columns of zeroes from the transposed matrix MT

MT=

we get generator matrix as Gcy of order( (d-1) l)

Gcy =

where l =7 and d-1 =4 . Using GFS, a 27-3 fractional factorial design is obtained with some main

effects A3, A4, A5, A6 and two factor interactions A1A2, A2A3, A2A6, A2A7, A3A4, A3A5, A3A6, A3A7,

A5A4, A6A4, A5A6, A5A7 are linear trend free.

b) BCH Codes

The BCH codes over GF(q) of length n = qm-1 and designed distance is the largest possible cyclic

code having zeroes b,,b+1,,b+-2 where GF( qm ) is the primitive nth root of unity, b is a non

negative integer and m is the multiplicative order of q mod n. The parity check matrix of a BCH code

with b=1 is given by

12
 1 2 ... ... ... n 1
1 3 ( ) ... ... ... ( )
3 2 3 n 1

1 5 ( 5 ) 2 ... ... ... ( 5 ) n 1

C= . . . . . .
. . . . . .
. .
2
.
2 2
. . .
2 n 1
( ) ( ) ... ... ...( )

1

where each entry is replaced by the corresponding binary m-tuple.

Example 3.: The parity check matrix of [15,5,7]2 code is

H=

and we observe here that d-1=6 columns in above matrix are linearly independent. Since the matrix

cannot be partitioned into the sub matrices ,we consider all 15 columns to get the design and they are

Suppose we select columns 8th,9th,10th,11th,12th and 13th from above matrix H .The

matrix obtained by selection is

M =

On transposing and deleting columns of zeroes we get matrix GBCH as

13
 GBCH =

Applying GFS on generator matrix with l = 10 and d-1 = 6 we get the design 210-4 fractional factorial

design with all main effects linear trend free. We list here some of the designs that can be generated by

selecting different columns of the generator matrix GBCH along with their defining relations

Table 2: Some generated fractional factorial designs with trend free effects and defining relations
using BCH code[15,5,7]2

Selected Generator Design and Defining Trend Free Main

Columns Matrix Relation Effects

I=ABCDJ=ACF
{123456} A,B,C,D,E,F,G,H,I,J
I=BCDH=
ACDEFG

{234567} I=BCDEFJ=ACFI=A B,C,D,H,I,J

BCF=
ACDEFG

{345678} I=ABCDEEJ=A
BCEFFI=ACEFH=A A,B,C,D,E,F,G,H,I,J
BCDFG

14
Selected Generator Design and Defining Trend Free Main
Columns Matrix Relation Effects

{456789} I= A,B,C,D,E,F,G,H,I
DFI=ABCEFH=ACE
FG

{5678910} A,B,C,D,E,F,G,H,I,J
I=CDFJ=ADFGH=B
DFI=ACDE

{67891011} A,B,C,D,E,G,H,I
I= CDFI=ABCEFH=
CDEFG

{789101112} A,B,C,D,E,G,H,I,J
I=BCDEHI=ACDF=A
DF

{8910111213} A,B,C,D,F,G,H,I,J
I=ABDEHI=ACEG=A
DF

{91011121314} A,B,C,D,E,F,G,H,I
I=ABEI=ADEGH=BD
EF

15
Selected Generator Design and Defining Trend Free Main
Columns Matrix Relation Effects

{101112131415} A,B,C,D,E,F,G,H,I
I=ADFI=ABFGH=CD
E

{123467} B,C,D,E,H,I,J
I=ABCDEFJ=ACFI=B
CFH =ACDEFG

{234678} B,C,D,G,H,I,J
I=ABCDEFJ=ACFI

=ABCFH=ACDEFG

A,B,C,D,F,G,H,I,J
{356789} I=CDFJ=ABCEFI

=ACEFH=CDEG

A,B,C,D,E,F,G,H
{47891011}
I= BDEH= ACDF

{589101112} A,B,C,D,E,F,G,H,I
I=ABDEHI=ABCDEG
=BCF

16
 Selected Generator Design and Defining Trend Free Main
Columns Matrix Relation Effects

A,B,C,D,F,G,H
{789101213}
I=ABDEGH=AEF

{81011131415} A,B,C,D,E,F,G,H,I
I=BCEI=
CDEGH=ABF

A,B,C,D,E,F,G,H
{68911121314}
I=AGH=BDF

A,B,C,D,E,G,H,I
{869101112} I=ABDEHI=BCG=BD
EF

A,B,C,D,E,G,H,I,J
{37891011} I=CDFJ=ABCEFI=AC
FH=
CDEFG

d) Ternary Golay Code

The Golay code were discovered by M.J.E.Golay in late 1940s. The (unextended) Golay code are

examples of perfect codes. A q-nary code that attains the hamming ( or sphere packing) bound i.e. the

17
one which has codewords, is said to be perfect code. Consider the

ternary Golay Code [11,6,5]3 over a ternary alphabet, the relative distance of the codes is as large as it

possibly can be for a ternary code, and it satisfies Hamming bound and is therefore a perfect ternary

Golay [11,6,5]3 code. For perfect code its dual distance is same as its covering radius. In terms of

design the strength is same as the estimation index of an orthogonal array obtained using this code.

Golay codes are unique in the sense that binary or ternary codes with same parameters, can be shown

to be equivalent to them.

Example 4: Consider the parity check matrix of [11,6,5]3 and partition it into two submatrices as
given in the method in section 4, we get the matrix H as

H=

Any four columns in matrix H511 are linearly independent d-1 = 4 and m = 5 . Thus,

15 sets of column in which none of the columns has weight (w) one.

Whereas the total possible selection of columns to formmatrix M is

325. Suppose we choose columns 1st,2nd,3rd and 4th from matrix H,

we get the matrix

M =

18
Next , we generate the matrices of order (45) that ensures the linear trend freeness of main effects

and following the steps of construction method , we get 35-1 fractional factorial design.

and the design generated using GFS on matrix Ggolay is given in the following Table 2.

Table 2: 35-1 fractional factorial design I= A1A22A3A42 along with their time counts

A1 A2 A3 A4 A5 T
C 0 0 0 0 1
1 1 1 1 1 2
2 2 2 2 2 3
1 1 2 2 0 4
2 2 0 0 1 5
0 0 1 1 2 6
2 2 1 1 0 7
0 0 2 2 1 8
1 1 0 0 2 9
1 2 1 0 2 10
2 0 2 1 0 11
0 1 0 2 1 12
2 0 0 2 2 13
0 1 1 0 0 14
1 2 2 1 1 15
0 1 2 1 2 16
1 2 0 2 0 17
2 0 1 0 1 18
2 1 2 0 1 19
0 2 0 1 2 20
1 0 1 2 0 21
0 2 1 2 1 22
1 0 2 0 2 23
2 1 0 1 0 24
1 0 0 1 1 25
2 1 1 2 2 26
0 2 2 0 0 27
2 1 0 1 2 28
19
A1 A2 A3 A4 A5 T
0 2 1 2 0 29
1 0 2 0 1 30
0 2 2 0 2 31
1 0 0 1 0 32
2 1 1 2 1 33
1 0 1 2 2 34
2 1 2 0 0 35
0 2 0 1 1 36
0 0 1 1 1 37
1 2 2 2 38
2 2 0 0 0 39
1 1 0 0 1 40
2 2 1 1 2 41
0 0 2 2 0 42
2 2 2 2 1 43
0 0 0 0 2 44
1 1 1 1 0 45
1 2 2 1 0 46
2 0 0 2 1 47
0 1 1 0 2 48
2 0 1 0 0 49
0 1 2 1 1 50
1 2 0 2 2 51
0 1 0 2 0 52
1 2 1 0 1 53
2 0 2 1 2 54
1 2 0 2 1 55
2 0 1 0 2 56
0 1 2 1 0 57
2 0 2 1 1 58
0 1 0 2 2 59
1 2 1 0 0 60
0 1 1 0 1 61
1 2 2 1 2 62
2 0 0 2 0 63
2 1 1 2 0 64
65
0 2 2 0 1
U
1 0 0 1 2 66
0 2 0 1 0 67
1 0 1 2 1 68
2 1 2 0 2 69
1 0 2 0 0 70
2 1 0 1 1 71
0 2 1 2 2 72

20
 A1 A2 A3 A4 A5 T
0 0 2 2 2 73
1 1 0 0 0 74
2 2 1 1 1 75
1 1 1 1 2 76
2 2 2 2 0 77
0 0 0 0 1 78
2 2 0 0 2 79
0 0 1 1 0 80
1 1 2 2 1 81
TC 0 0 0 0 0

6. Blocking in Fractional Factorial Design with some Linear Trend Free Effects

When the block size is smaller than the number of treatment combinations in any factorial experiment,

the technique of blocking is used to carry out the analysis. The factorial/fractional factorial experiment

thus obtained is known as Blocked fractional factorial experiment. When we go for blocking of

fractional factorial design, the block structure affects the linear trend-freeness of the effects. We state

here the result in continuation with the properties [1-3] . The first h=n-p-r generates the principle

block and let zv , h+1 v n-p be the generators of other blocks. Then the following holds:

Property 4: For any given v, h+1 v n-p and factor say A1 , suppose z1v 0. Then

(a) All (q-1) main effect components are linear trend-free.

(b) If ziv = 0 , 2 i n-p, then all components of A1 Ai interaction are linear trend-free.

The method described is used to construct Blocked fractional factorial designs with some linear
trend free effects.

Reed Muller Code: We use here the generator matrix in Example 1 by selecting columns 8th,9th and
10th

21
We get 24-1 fractional factorial design, here q=2, n=3, p=1, r1=1, h=n-p-r1=1 independent

generators. Using GFS, h=2 generators forms the principle block and remaining generators

form the contents of the other block in which main effects A and C are linear trend free. The

confounded effect of the design is ABC.

Using GFS 25-1 fractional factorial design is obtained n=5, p1=1, s=2, r1=1, h = n-p-r1 = 5-1-1 = 3

independent generators, generates the principal block and other generates the other block contents.

Table 5 gives the design generated.

Table 5: 25-1 blocked fractional factorial design with resolution IV, I = ABCE

Block 1: (1), ab, bc , ac, acd, bcd , abd , d

Block 2: ce, abce, be,ae,ade , bde , abcde , cde

BCH Code: Consider the generator matrix in Example 3 by selecting columns 1st, 4th, 5th, 6th, 7th and

8th as GBCH =

29-3 fractional factorial design is obtained, here n=9, p=3 , r1=1 and h = n-p-r1 = 9-3-1= 5

independent generators forms the principal block and remaining generators the other block.

22
Thus, Blocked 29-3 fractional factorial.design with defining relation I = DEGJ= ABDEH = BCDF

is obtained. Table 7 displays the first 16 runs of the design constituting the principle block and

the next 16 the other block and so on.

Table 6:29-3 blocked fractional factorial design with resolution IV, I= DEFJ = ABDEH =BCDF

Block 1: (1), aej, dfhj, adefh, abefgh, bfghj, abdegj, bdg, bcej, abc, cdefh, abcdfhj, acfghj,
cdhj, acdeh, cf, acefj, abcdefj, bcdfg, abcegh, bcghj, bdeh, bdhj, bef, abf, adfg, defgj, aghj, egh.
Block 2: abdgh, bdeghj, abfgj, befg, def, adfj, ehj, ah, acdeghj, bcfg, acefg, cfgj, bcdfj, abcdef, bch,
abcehj, abcgj, abcdfgh, bcdefghj, cefhj, acfh, bcd, acdj, aeg, gj, adefg. dfgh, bfh, abefhj, bdj, abde.

Ternary Golay Code: Consider the generator matrix from Example 4 by selecting columns 1st,2nd,

3rd and 4th of matrix H as

Ggolay =

35-1 fractional factorial design is obtained. Here n= 5, p1=1 and q=3 , r1=1 ,h=n-p-r1=3 independent

generators are obtained. Thus, principal block is generated by first three generators and remaining two

generates the content of the other block. First 33 treatment combinations in 35-1 fractional factorial

design (given in Table 7) forms the principle block and next 33 combinations forms the contents of

second block and the remaining the third block contents. The factors are denoted by A,B,C,D and E.

Table 7: 35-1 blocked fractional factorial design with resolution IV, I= ABCDE

23
 Block 1: (1), abcde, a2b2c2d2e2, abc2d2, a2b2e, cde2 , a2b2cd, c2d2e, abe2, ab2ce2, a2c2d , bd2e,
a2d2e2, bc, ab2c2de, bc2de2, ab2d, a2ce, a2bc2e, b2de2, acd2, b2cd2e, ac2d2, b2ce, ade,
a2bcd2e2, b2d2 .

Block 2: a2bde2, b2cd2, ac2e, b2c2e2, ad, a2bcd2e, acd2e2, a2bc2, b2de, cde, abc2d2e2, a2b2, abe,
a2b2cde2, c2d2, a2b2c2d2e, e2, abcd, ab2c2d, a2d2e, bce2, a2c, ab2cd, ab2d2e2, bd2, ab2de,
a2c2de2.

Block 3: ab2d2e, a2ce2, bc2d, a2c2de, bd2e2, ab2c, bce, ab2c2de2, a2d2, a2bcd2, b2d2e, ade, b2d, acd2e,
a2bc2e2, ac2, a2bde, b2cd2e2, c2d2e2, ab, a2b2cde, abcde2, a2b2c2d2, e, a2b2e2, cd, abc2d2e.

Conclusion: A technique to construct fractional factorial designs with factors at q level, q>2, with

some linear trend free effects using parity check/generator matrix of linear code is developed. Since

the generator matrix is not unique in nature, therefore fractional factorial designs with linear trend

free effects with same/ different resolution can be easily constructed.

References:
1) Bailey, R.A., Cheng, C.S. and Kipnis, P. Construction of trend resistant factorial designs.
Statist. Sinica, 2. 1992. 393-411.

2) Betsumiya, K and Harada ,M. Classification of Formally Self-Dual Even Codes of length to 16.
Designs, Codesand Cryptography, 23. 2001. 325-332.

3) Cox, D.R. Some systematic experimental designs. Biometrika, 38. 1952. 312- 323.

4) Coster, D.C. and Cheng, C.S. Minimum cost trend free run orders of fractional factorial design.
The Annals of Statistics, 16 (3), 1998. 1188-1205.
24
5) Cheng, C.S. and Jacroux, M. On the construction of trend free run-order of two level factorial
designs. Journal of American statistical association, 83. 1988. 1152-1158.
p-q
6) Daniel, C. and Wilcoxon, F. Factorial 2 plans robust against linear and quadratic trends.
Technometrics, 8. 1966 . 259-278.
7) Draper, N.R. and Stoneman, D.M. Factor changes and linear trends in eight run two level
factorial designs. Technometrics, 10. 1968. 301-311.
8) Hill, H.H. Experimental Designs to adjust for time trends. Technometrics , 2. 1960. 67-82.
9) Hedayat, A.S., Sloane, N.J.A and Stuffken. Orthogonal Arrays: Theory and applications
Springer, New York. 1999.
10) Hilow, H. Minimum cost linear trend free fractional factorial designs. Journal of statistical
theory and practice, 6. 2012. 580-589.
11) Joiner, B.L. and Campbell, C. Designing experiments when run order is important.
Technometrics, 18. 1976. 249-259.
12) MacWilliams, F.J., and Sloane,N.J.A. The Theory of Error-Correcting Codes Oxford, N North-
Holland, Amesterdam.1977.
13) Freeny, A.E and Lai, W.Y.C. Planarization by chemical Mechanical polishing: A rate and
uniformity study. Statistical case studies for industrial Process Improvement. V. Czitrom and P.D.
Spagon eds Philadelphia, Alexandria: ASA-SIAM, pp. 251-264Freeny,A. E. and Lai, W.Y.C.
1997.

25