A technique to construct linear trend free fractional factorial design using some linear codes
|
|
- Nora Griffith
- 6 years ago
- Views:
Transcription
1 International Journal of Statistics and Mathematics Vol. 3(1), pp , February, ISSN: x IJSM Research Article A technique to construct linear trend free fractional factorial design using some linear codes Poonam Singh 1, Puja Thapliyal 2*, Veena Budhraja 3 1 Department of Statistics,Faculty of Mathematical Sciences, University of Delhi,Delhi , India. 2* Department of Statistics, Faculty of Mathematical Sciences, University of Delhi,Delhi , India. 3 Department of Statistics, Sri Venkateswara College, University of Delhi, India. Co-author: veena_budhraja@yahoo.co.in, pbs_93@yahoo.co.in *Corresponding author pujathapliyal98@gmail.com Sometimes, an experimental situation may arise where experimental units are following smooth pattern of trend over time and space. In that situation, to eliminate the effect of uncontrollable variables that are correlated with the time, we use systematic run order instead of randomising the run order. An ordering of treatments, thus obtained is known as Trend free design. This article presents a method for constructing trend free fractional factorial design using parity check matrix of a linear code. The method provides a systematic approach to construct fractional and blocked fractional factorial design with trend free main effects and some two- factor interactions. Keywords: Time count, Linear Codes, Reed Muller Codes, BCH codes,generalised Foldover Scheme 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. 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 2 n design and using the contrasts to generate a new run order. Cheng and Jacroux (1988) generalised Daniel and Wilcoxon work for 2 n 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. Adekeys and Kuner(2006) compared the run order of 2 k-p design in the presence of time trend. The two level trend robust fractional factorial designs were analysed by Mee and Romanova(2010). In Recent years, Hilow(2012) developed an assignment procedures of constructing minimum cost trend free two level fractional factorial designs.some trend free designs in blocked fractional factorial designs were being studied and investigated by Wu and Soushan(2013). 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 Singh et al. 073 PRELIMINARIES Fractional Factorial Design: Let D = (q r n-p ) denote a q -p fraction of the q n factorial design in q r incomplete blocks. Let N = q n-p be the number of treatment combinations, K=q n-p-r be the size of each block and B = q r be the number of blocks.the linear model for the q n factorial design is given as (1) Where y is the N 1 column vector of observations, X is the N n design matrix of known constants; N is the n 1 column vector of regression coefficients and e is the N 1 column vector of random errors with zero means and variance σ 2.. When block effects are considered, the model is changed to with B= is N B block matrix with block size K and γ is the corresponding (K 1) block. (2) Definition1: Let denotes the ordered vector of observations, for x = 0,1,2,... be the N 1 vector of trend coefficients and let u i be the contrast for main effect A i ; i=1,2,...n, in the run order. Then the quantity is known as the time count for the main effect A i.. A necessary and sufficient condition for a main effect contrast u to be In general, an N 1 vector u is called trend free if equation(1.1) holds. trend free is that When the assumption of trend effect of different factors of the design is also considered, then this assumption changes the model (2) to (3) Where, t is the (K 1) linear vector and is the trend effect coefficient.the model (3) 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.1) (1.2) Where is an Nn matrix of factor effect coefficients and T is the Nv matrix of polynomial trend coefficients. If equation(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 equation (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= (q r n-p ) with n factors A 1, A 2,..A n let G be the generator matrix of design given by
3 Int. J. Stat. Math. 074 Let be a 1 n 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 q n-p-r runs; the second block consist of the next q n-p-r runs, and so on. For a factorial design D 1 =(q n-p r ), let be the n factors and G be the generator matrix of design D 1 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 one of the two factors appears at non-zero level. For linear trend free design, the above conditions can be described in the following properties: 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:Forany 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 linear trend free. LINEAR CODES interaction are 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. FACTORIAL DESIGNS WITH SOME LINEAR TREND FREE EFFECTS GFS provides a technique to construct linear trend free factional factorial designs using generator matrix, but there is no general method to construct the generator matrix. We use the parity check matrix of a linear [n,k,d] q code to obtain the set of generators to construct the desired designs. Method of Construction 1. Consider the parity check matrix H n-k n of a linear [n,k,d] q code. 2. Partition the matrix H in two submatrix F 1 and F 2, where F 2 consists of the vectors with weight (w) one. 3. Let m denotes the number of columns in F 2. 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 F 2. The order of M is n-k d Write the transpose of M and the transpose be denoted by MT of order (d-1 n-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 Apply GFS on G α to obtain the fractional factorialdesign q l-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.
4 Singh et al. 075 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 q l 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 α. 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. The proof of the theorem can be obtained from the sequence of steps given in the construction method. The proof(*) is available with the authors. * Theorem1: Existence of a linear [n, k, d] q code implies the existence of q l-r {1 r (n-k)-(d-1) & (d-1)+1 l n-k },fractional factorial design and q l ( 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 α. 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 r th order binary Reed-Muller code R(r,a) of length n = 2 a, for 0 r a, is the set of all vectors f, where f(i 1,..i a ) 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 r th order RM code R(r,a) with the following properties: Length n = 2 a, dimension k = + + and minimum distance 2 a-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= Any three columns in parity check matrix H matrix are linearly independent. Here d-1=3, and m =5 (in F 2 ) 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) one and 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.
5 Int. J. Stat. Math. 076 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 4 th, 5 th and 6 th to form the matrix M RM = On transposing we get matrix as G RM 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 =A 1 A 3 A 5 = A 1 A 2 A 3 A 4 = A 2 A 4 A 5. Using the properties 1and 2 we observe that main effect component of A 1, A 3, A 5 and the two factor interaction A 1 A 2, A 1 A 3 and A 2 A 4 and A 3 A 4 are linear trend free. Cyclic Codes A linear code over GF(q) is said to be cyclic if whenever (c 0,c 1,..,c n-2,c n-1 ) is a codeword so also is (c 1,c 2,..,c n-1,c 0 ). Cyclic arrays can be described by a single generating vector z = ( z 0 z 1.z n-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) = z 0 + z 1 X + +z n- 1X n-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). Theorem 2: If C is a cyclic code of length n over GF(q), with generator polynomial z(x), then the dual code C cyclic and has generator polynomial where z * (x) = X deg.z z(x -1 ) is reciprocal polynomial to z(x). is also 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) = x 7 ( 1+ x -4 +x -6 +x -7 ) = 1+x+x 3 +x 7 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 H cy = = 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 4 th, 5 th, 6 th and 7 th gives the matrix M cy(8 4 M cy(8 4=
6 Singh et al. 077 Deleting column of zeroes and transposing MT= we get generator matrix as G cy of order( (d-1) l) G cy = where l =7 and d-1 =4. Using GFS, a fractional factorial design is obtained with some main effects A 3, A 4, A 5, A 6 and two factor interactions A 1 A 2, A 2 A 3, A 2 A 6, A 2 A 7, A 3 A 4, A 3 A 5, A 3 A 6, A 3 A 7, A 5 A 4, A 6 A 4, A 5 A 6, A 5 A 7 are linear trend free. BCH Codes The BCH codes over GF(q) of length n = q m -1 and designed distance δ is the largest possible cyclic code having zeroes α b,, α b+1,,α b+δ-2 where α є GF( q m ) is the primitive n th 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 2 n n1 1 ( ) ( ) C= n1 1 ( ) ( ) n1 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 8 th,9 th,10 th,11 th,12 th and 13 th from above matrix H.The matrix obtained by selection is M =
7 Int. J. Stat. Math. 078 On transposing and deleting columns of zeroes we get matrix G BCH as G BCH = Applying GFS on generator matrix with l = 10 and d-1 = 6 we get the design fractional factorial design with all main effects linear trend free. Some of the designs that can be generated by selecting different columns of the generator matrix G BCH of the code [15,5,7] 2 along with their defining relations are available with the author. Ternary Golay Code The Golay code were discovered by M.J.E.Golay in late 1940 s. The (unextended) Golay code are examples of perfect codes. A q-nary code that attains the hamming ( or sphere packing) bound i.e. the 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 H 5 11 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 1 st,2 nd,3 rd and 4 th from matrix H, we get the matrix M =. Next, we generate the matrices of order (4 5) that ensures the linear trend freeness of main effects and following the steps of construction method, we get fractional factorial design. and then fractional factorial design I= A 1 A A 3 A 4 is generated using GFS on matrix G golay. The generated design has all its main effects linear trend free with respect to the properties [1-3].
8 Singh et al. 079 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 z v, 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 A 1, suppose z 1v 0. Then (a) All (q-1) main effect components are linear trend-free. (b) If z iv = 0, 2 i n-p, then all components of A 1 A i interaction are linear trend-free. (c) 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 constructed in Example 1 by selecting columns 8 th,9 th and 10 th We get fractional factorial design, here q=2, n=3, p=1, r 1 =1, h=n-p-r 1 =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. Table fractional factorial design with resolution III, I=ABC Block 1: (1), acd, abd, bc Block 2: c, ac, ab, bcd Cyclic Code: We consider here generator matrix constructed in example 2 and by selecting 1 st, 2 nd,5 th and 9 th columns We get G cy = Using GFS fractional factorial design is obtained n=5, p 1 =1, s=2, r 1 =1, h = n-p-r 1 = = 3 independent generators, generates the principal block and other generates the other block contents. Table 1 gives the design generated. Table 2 : blocked fractional factorial design with resolution IV, I = ABCE Block 1: Block 2: (1), ab, bc, ac, acd, bcd, abd, d ce, abce, be, ae, ade, bde, abcde, cde BCH Code: Consider the generator matrix in Example 3 by selecting columns 1 st, 4 th, 5 th, 6 th, 7 th and 8 th as G BCH = fractional factorial design is obtained, here n=9, p=3, r 1 =1 and h = n-p-r 1 = 9-3-1= 5 independent generators forms the principal block and remaining generators the other block. Thus, Blocked fractional factorial.design with defining relation I = DEGJ= ABDEH = BCDF is obtained. Table 3 displays the first 16 runs of the design constituting the principle block and the next 16 the other block and so on.
9 Int. J. Stat. Math. 080 Table 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 1 st,2 nd, 3 rd and 4 th of matrix H as G golay = fractional factorial design is obtained. Here n= 5, p 1 =1 and q=3, r 1 =1,h=n-p-r 1 =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 3 3 treatment combinations in fractional factorial design (given in Table 4 ) forms the principle block and next 3 3 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 4: blocked fractional factorial design with resolution IV, I= ABCDE Block 1: (1), abcde, a 2 b 2 c 2 d 2 e 2, abc 2 d 2, a 2 b 2 e, cde 2, a 2 b 2 cd, c 2 d 2 e, abe 2, ab 2 ce 2, a 2 c 2 d, bd 2 e, a 2 d 2 e 2, bc, ab 2 c 2 de, bc 2 de 2, ab 2 d, a 2 ce, a 2 bc 2 e, b 2 de 2, acd 2, b 2 cd 2 e, ac 2 d 2, b 2 ce, ade, a 2 bcd 2 e 2, b 2 d 2. Block 2: a 2 bde 2, b 2 cd 2, ac 2 e, b 2 c 2 e 2, ad, a 2 bcd 2 e, acd 2 e 2, a 2 bc 2, b 2 de, cde, abc 2 d 2 e 2, a 2 b 2, abe, a 2 b 2 cde 2, c 2 d 2, a 2 b 2 c 2 d 2 e, e 2, abcd, ab 2 c 2 d, a 2 d 2 e, bce 2, a 2 c, ab 2 cd, ab 2 d 2 e 2, bd 2, ab 2 de, a 2 c 2 de 2. Block 3: ab 2 d 2 e, a 2 ce 2, bc 2 d, a 2 c 2 de, bd 2 e 2, ab 2 c, bce, ab 2 c 2 de 2, a 2 d 2, a 2 bcd 2, b 2 d 2 e, ade, b 2 d, acd 2 e, a 2 bc 2 e 2, ac 2, a 2 bde, b 2 cd 2 e 2, c 2 d 2 e 2, ab, a 2 b 2 cde, abcde 2, a 2 b 2 c 2 d 2, e, a 2 b 2 e 2, cd, abc 2 d 2 e. 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 Adekeys K, Kunert J (2006). On the Comparison of Run Orders of Unreplicated 2 k-p designs in the presence of a Time Trend. Metrika. 63: Bailey RA, Cheng CS, Kipnis P (1992). Construction of trend resistant factorial designs. Statist. Sinica. 2: Betsumiya K, Harada M (2001). Classification of Formally Self-Dual Even Codes of length to 16. Designs, Codes and Cryptography. 23: Cheng CS, Jacroux M. (1988).On the construction of trend free run-order of two level factorial designs. Journal of American statistical association. 83: Cox DR (1951). Some systematic experimental designs. Biometrica. 38: Coster DC, Cheng CS (1998). Minimum cost trend free run orders of fractional factorial design. The Annals of Statistics. 16: Daniel C, Wilcoxon F (1966). Factorial 2 p-q plans robust against linear and quadratic trends.technometrics. 8: Draper NR, Stoneman DM (1968). Factor changes and linear trends in eight run two level factorial designs. Technometrics. 10:
10 Singh et al. 081 Freeny AE, Lai WYC (1997). Planarization by chemical Mechanical polishing: A rateand uniformity study. Statistical case studies for industrial Process Improvement. V. Czitrom and P.D. Spagon eds Philadelphia, Alexandria: ASA- SIAM, pp Hedayat, AS, Sloane NJA, Stuffken J (1999). Orthogonal Arrays: Theory and applications. New York. US: Springer and Verlag , , Hill HH (1960).Experimental Designs to adjust for time trends. Technometrics. 2: Hilow H (2012). Minimum cost linear trend free fractional factorial designs. Journal of statistical theory and practice. 6: Joiner BL, Campbell C (1976). Designing experiments when run order is important. Technometrics. 18: Mac Williams FJ, Sloane NJA (1977). The Theory of Error-Correcting Codes. North- Holland. Amesterdam: Oxford. Mee R, Romanora A (2010). Constructing and Analyzing Two-level Trend Robust designs. Quality Enigeneering. 22: Wang PC, Wu S (2013). Trend Free Designs in Blocked Fractional Factorial Experiments. Communications in Statistics- Theory and Methods. 42(10): Accepted December 31, Citation: Singh P, Thapliyal P, Budhraja V (2016). A Technique to Construct Linear Trend Free Fractional Factorial Design Using Some Linear Codes. International Journal of Statistics and Mathematics 3(1): Copyright: 2016 Singh et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.
proposed. This method can easily be used to construct the trend free orthogonal arrays of higher level and higher strength.
International Journal of Scientific & Engineering Research, Volume 5, Issue 7, July-2014 1512 Trend Free Orthogonal rrays using some Linear Codes Poonam Singh 1, Veena Budhraja 2, Puja Thapliyal 3 * bstract
More informationRestricted Randomized Two-level Fractional Factorial Designs using Gray Code
Restricted Randomized Two-level Fractional Factorial Designs using Gray Code Dr. Veena Budhraja Department of Statistics, Sri Venkateswara College, University of Delhi, Delhi Mrs. Puja Thapliyal Assistant
More informationFRACTIONAL FACTORIAL
FRACTIONAL FACTORIAL NURNABI MEHERUL ALAM M.Sc. (Agricultural Statistics), Roll No. 443 I.A.S.R.I, Library Avenue, New Delhi- Chairperson: Dr. P.K. Batra Abstract: Fractional replication can be defined
More informationELEC 519A Selected Topics in Digital Communications: Information Theory. Hamming Codes and Bounds on Codes
ELEC 519A Selected Topics in Digital Communications: Information Theory Hamming Codes and Bounds on Codes Single Error Correcting Codes 2 Hamming Codes (7,4,3) Hamming code 1 0 0 0 0 1 1 0 1 0 0 1 0 1
More informationConstruction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing
Construction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing Vladimir Brayman Webtrends October 19, 2012 Advantages of Conducting Designed Experiments in Digital Marketing Availability
More informationMinimum Aberration and Related Criteria for Fractional Factorial Designs
Minimum Aberration and Related Criteria for Fractional Factorial Designs Hegang Chen Division of Biostatistics and Bioinformatics 660 West Redwood Street University of Maryland School of Medicine Baltimore,
More informationMATH602: APPLIED STATISTICS
MATH602: APPLIED STATISTICS Dr. Srinivas R. Chakravarthy Department of Science and Mathematics KETTERING UNIVERSITY Flint, MI 48504-4898 Lecture 10 1 FRACTIONAL FACTORIAL DESIGNS Complete factorial designs
More informationOn Construction of a Class of. Orthogonal Arrays
On Construction of a Class of Orthogonal Arrays arxiv:1210.6923v1 [cs.dm] 25 Oct 2012 by Ankit Pat under the esteemed guidance of Professor Somesh Kumar A Dissertation Submitted for the Partial Fulfillment
More informationSome Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties
Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties HONGQUAN XU Department of Statistics, University of California, Los Angeles, CA 90095-1554, U.S.A. (hqxu@stat.ucla.edu)
More informationFractional Replications
Chapter 11 Fractional Replications Consider the set up of complete factorial experiment, say k. If there are four factors, then the total number of plots needed to conduct the experiment is 4 = 1. When
More informationStrategy of Experimentation III
LECTURE 3 Strategy of Experimentation III Comments: Homework 1. Design Resolution A design is of resolution R if no p factor effect is confounded with any other effect containing less than R p factors.
More informationThe Binary Self-Dual Codes of Length Up To 32: A Revised Enumeration*
The Binary Self-Dual Codes of Length Up To 32: A Revised Enumeration* J. H. Conway Mathematics Department Princeton University Princeton, New Jersey 08540 V. Pless** Mathematics Department University of
More informationProjection properties of certain three level orthogonal arrays
Metrika (2005) 62: 241 257 DOI 10.1007/s00184-005-0409-9 ORIGINAL ARTICLE H. Evangelaras C. Koukouvinos A. M. Dean C. A. Dingus Projection properties of certain three level orthogonal arrays Springer-Verlag
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More informationSession 3 Fractional Factorial Designs 4
Session 3 Fractional Factorial Designs 3 a Modification of a Bearing Example 3. Fractional Factorial Designs Two-level fractional factorial designs Confounding Blocking Two-Level Eight Run Orthogonal Array
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationConstruction of some new families of nested orthogonal arrays
isid/ms/2017/01 April 7, 2017 http://www.isid.ac.in/ statmath/index.php?module=preprint Construction of some new families of nested orthogonal arrays Tian-fang Zhang, Guobin Wu and Aloke Dey Indian Statistical
More informationExtended Binary Linear Codes from Legendre Sequences
Extended Binary Linear Codes from Legendre Sequences T. Aaron Gulliver and Matthew G. Parker Abstract A construction based on Legendre sequences is presented for a doubly-extended binary linear code of
More informationPAijpam.eu CONVOLUTIONAL CODES DERIVED FROM MELAS CODES
International Journal of Pure and Applied Mathematics Volume 85 No. 6 013, 1001-1008 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v85i6.3
More information} has dimension = k rank A > 0 over F. For any vector b!
FINAL EXAM Math 115B, UCSB, Winter 2009 - SOLUTIONS Due in SH6518 or as an email attachment at 12:00pm, March 16, 2009. You are to work on your own, and may only consult your notes, text and the class
More informationAlgorithmic Construction of Efficient Fractional Factorial Designs With Large Run Sizes
Algorithmic Construction of Efficient Fractional Factorial Designs With Large Run Sizes Hongquan Xu Department of Statistics University of California Los Angeles, CA 90095-1554 (hqxu@stat.ucla.edu) February
More informationOn the Compounds of Hat Matrix for Six-Factor Central Composite Design with Fractional Replicates of the Factorial Portion
American Journal of Computational and Applied Mathematics 017, 7(4): 95-114 DOI: 10.593/j.ajcam.0170704.0 On the Compounds of Hat Matrix for Six-Factor Central Composite Design with Fractional Replicates
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
More informationTWO-LEVEL FACTORIAL EXPERIMENTS: REGULAR FRACTIONAL FACTORIALS
STAT 512 2-Level Factorial Experiments: Regular Fractions 1 TWO-LEVEL FACTORIAL EXPERIMENTS: REGULAR FRACTIONAL FACTORIALS Bottom Line: A regular fractional factorial design consists of the treatments
More informationComputer Aided Construction of Fractional Replicates from Large Factorials. Walter T. Federer Charles E. McCulloch. and. Steve C.
Computer Aided Construction of Fractional Replicates from Large Factorials by Walter T. Federer Charles E. McCulloch and Steve C. Wang Biometrics Unit and Statistics Center Cornell University Ithaca, NY
More informationOptimal Selection of Blocked Two-Level. Fractional Factorial Designs
Applied Mathematical Sciences, Vol. 1, 2007, no. 22, 1069-1082 Optimal Selection of Blocked Two-Level Fractional Factorial Designs Weiming Ke Department of Mathematics and Statistics South Dakota State
More informationAn Application of Coding Theory into Experimental Design Construction Methods for Unequal Orthogonal Arrays
The 2006 International Seminar of E-commerce Academic and Application Research Tainan, Taiwan, R.O.C, March 1-2, 2006 An Application of Coding Theory into Experimental Design Construction Methods for Unequal
More informationFRACTIONAL REPLICATION
FRACTIONAL REPLICATION M.L.Agarwal Department of Statistics, University of Delhi, Delhi -. In a factorial experiment, when the number of treatment combinations is very large, it will be beyond the resources
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationTWO-LEVEL FACTORIAL EXPERIMENTS: IRREGULAR FRACTIONS
STAT 512 2-Level Factorial Experiments: Irregular Fractions 1 TWO-LEVEL FACTORIAL EXPERIMENTS: IRREGULAR FRACTIONS A major practical weakness of regular fractional factorial designs is that N must be a
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationSolutions to Exercises
1 c Atkinson et al 2007, Optimum Experimental Designs, with SAS Solutions to Exercises 1. and 2. Certainly, the solutions to these questions will be different for every reader. Examples of the techniques
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationThe One-Quarter Fraction
The One-Quarter Fraction ST 516 Need two generating relations. E.g. a 2 6 2 design, with generating relations I = ABCE and I = BCDF. Product of these is ADEF. Complete defining relation is I = ABCE = BCDF
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationExperimental design (DOE) - Design
Experimental design (DOE) - Design Menu: QCExpert Experimental Design Design Full Factorial Fract Factorial This module designs a two-level multifactorial orthogonal plan 2 n k and perform its analysis.
More informationReference: Chapter 8 of Montgomery (8e)
Reference: Chapter 8 of Montgomery (8e) 69 Maghsoodloo Fractional Factorials (or Replicates) For Base 2 Designs As the number of factors in a 2 k factorial experiment increases, the number of runs (or
More informationConstruction of row column factorial designs
J. R. Statist. Soc. B (2019) Construction of row column factorial designs J. D. Godolphin University of Surrey, Guildford, UK [Received February 2018. Final revision October 2018] Summary. The arrangement
More informationA UNIFIED APPROACH TO FACTORIAL DESIGNS WITH RANDOMIZATION RESTRICTIONS
Calcutta Statistical Association Bulletin Vol. 65 (Special 8th Triennial Symposium Proceedings Volume) 2013, Nos. 257-260 A UNIFIED APPROACH TO FACTORIAL DESIGNS WITH RANDOMIZATION RESTRICTIONS PRITAM
More informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More informationA Survey of Rational Diophantine Sextuples of Low Height
A Survey of Rational Diophantine Sextuples of Low Height Philip E Gibbs philegibbs@gmail.com A rational Diophantine m-tuple is a set of m distinct positive rational numbers such that the product of any
More informationCoding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014
Anna Dovzhik 1 Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014 Sharing data across channels, such as satellite, television, or compact disc, often
More informationELEC 405/ELEC 511 Error Control Coding and Sequences. Hamming Codes and the Hamming Bound
ELEC 45/ELEC 5 Error Control Coding and Sequences Hamming Codes and the Hamming Bound Single Error Correcting Codes ELEC 45 2 Hamming Codes One form of the (7,4,3) Hamming code is generated by This is
More informationESTIMATION METHODS FOR MISSING DATA IN UN-REPLICATED 2 FACTORIAL AND 2 FRACTIONAL FACTORIAL DESIGNS
Journal of Statistics: Advances in Theory and Applications Volume 5, Number 2, 2011, Pages 131-147 ESTIMATION METHODS FOR MISSING DATA IN k k p UN-REPLICATED 2 FACTORIAL AND 2 FRACTIONAL FACTORIAL DESIGNS
More informationERROR CORRECTING CODES
ERROR CORRECTING CODES To send a message of 0 s and 1 s from my computer on Earth to Mr. Spock s computer on the planet Vulcan we use codes which include redundancy to correct errors. n q Definition. A
More informationx n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)
Cyclic codes: review EE 387, Notes 15, Handout #26 A cyclic code is a LBC such that every cyclic shift of a codeword is a codeword. A cyclic code has generator polynomial g(x) that is a divisor of every
More informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
More informationUnsolved Problems in Graph Theory Arising from the Study of Codes*
Unsolved Problems in Graph Theory Arising from the Study of Codes* N. J. A. Sloane Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, NJ 07974 1. Two fundamental questions in coding
More informationChapter 7 Reed Solomon Codes and Binary Transmission
Chapter 7 Reed Solomon Codes and Binary Transmission 7.1 Introduction Reed Solomon codes named after Reed and Solomon [9] following their publication in 1960 have been used together with hard decision
More informationG Solution (10 points) Using elementary row operations, we transform the original generator matrix as follows.
EE 387 October 28, 2015 Algebraic Error-Control Codes Homework #4 Solutions Handout #24 1. LBC over GF(5). Let G be a nonsystematic generator matrix for a linear block code over GF(5). 2 4 2 2 4 4 G =
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationA General Criterion for Factorial Designs Under Model Uncertainty
A General Criterion for Factorial Designs Under Model Uncertainty Steven Gilmour Queen Mary University of London http://www.maths.qmul.ac.uk/ sgg and Pi-Wen Tsai National Taiwan Normal University Fall
More informationELEC-E7240 Coding Methods L (5 cr)
Introduction ELEC-E7240 Coding Methods L (5 cr) Patric Östergård Department of Communications and Networking Aalto University School of Electrical Engineering Spring 2017 Patric Östergård (Aalto) ELEC-E7240
More informationM 2 + s 2. Note that the required matrix A when M 2 + s 2 was also obtained earlier by Gordon [2]. (2.2) x -alxn-l-aex n-2 an
SIAM J. ALG. DISC. METH. Vol. 1, No. 1, March 1980 1980 Society for. Industrial and Applied Mathematics 0196-52/80/0101-0014 $01.00/0 ON CONSTRUCTION OF MATRICES WITH DISTINCT SUBMATRICES* SHARAD V. KANETKAR"
More informationMoment Aberration Projection for Nonregular Fractional Factorial Designs
Moment Aberration Projection for Nonregular Fractional Factorial Designs Hongquan Xu Department of Statistics University of California Los Angeles, CA 90095-1554 (hqxu@stat.ucla.edu) Lih-Yuan Deng Department
More informationELEC 405/ELEC 511 Error Control Coding. Hamming Codes and Bounds on Codes
ELEC 405/ELEC 511 Error Control Coding Hamming Codes and Bounds on Codes Single Error Correcting Codes (3,1,3) code (5,2,3) code (6,3,3) code G = rate R=1/3 n-k=2 [ 1 1 1] rate R=2/5 n-k=3 1 0 1 1 0 G
More informationA class of mixed orthogonal arrays obtained from projection matrix inequalities
Pang et al Journal of Inequalities and Applications 2015 2015:241 DOI 101186/s13660-015-0765-6 R E S E A R C H Open Access A class of mixed orthogonal arrays obtained from projection matrix inequalities
More informationType I Codes over GF(4)
Type I Codes over GF(4) Hyun Kwang Kim San 31, Hyoja Dong Department of Mathematics Pohang University of Science and Technology Pohang, 790-784, Korea e-mail: hkkim@postech.ac.kr Dae Kyu Kim School of
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationHamming Codes 11/17/04
Hamming Codes 11/17/04 History In the late 1940 s Richard Hamming recognized that the further evolution of computers required greater reliability, in particular the ability to not only detect errors, but
More informationConstruction of optimal Two- Level Supersaturated Designs
RASHI 1 (2) :41-50 (2016) Construction of optimal Two- Level Supersaturated Designs Basudev Kole and Gourav Kumar Rai Department of Statistics, Mathematics & Computer Application Bihar Agricultural University,
More informationSTAT451/551 Homework#11 Due: April 22, 2014
STAT451/551 Homework#11 Due: April 22, 2014 1. Read Chapter 8.3 8.9. 2. 8.4. SAS code is provided. 3. 8.18. 4. 8.24. 5. 8.45. 376 Chapter 8 Two-Level Fractional Factorial Designs more detail. Sequential
More information5.0 BCH and Reed-Solomon Codes 5.1 Introduction
5.0 BCH and Reed-Solomon Codes 5.1 Introduction A. Hocquenghem (1959), Codes correcteur d erreurs; Bose and Ray-Chaudhuri (1960), Error Correcting Binary Group Codes; First general family of algebraic
More informationCONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS
Statistica Sinica 24 (2014), 1685-1702 doi:http://dx.doi.org/10.5705/ss.2013.239 CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS Mingyao Ai 1, Bochuan Jiang 1,2
More informationST3232: Design and Analysis of Experiments
Department of Statistics & Applied Probability 2:00-4:00 pm, Monday, April 8, 2013 Lecture 21: Fractional 2 p factorial designs The general principles A full 2 p factorial experiment might not be efficient
More informationOptimal Fractional Factorial Plans for Asymmetric Factorials
Optimal Fractional Factorial Plans for Asymmetric Factorials Aloke Dey Chung-yi Suen and Ashish Das April 15, 2002 isid/ms/2002/04 Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationCodes over Subfields. Chapter Basics
Chapter 7 Codes over Subfields In Chapter 6 we looked at various general methods for constructing new codes from old codes. Here we concentrate on two more specialized techniques that result from writing
More informationORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES
ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are
More informationConstruction and analysis of Es 2 efficient supersaturated designs
Construction and analysis of Es 2 efficient supersaturated designs Yufeng Liu a Shiling Ruan b Angela M. Dean b, a Department of Statistics and Operations Research, Carolina Center for Genome Sciences,
More informationNew Families of Triple Error Correcting Codes with BCH Parameters
New Families of Triple Error Correcting Codes with BCH Parameters arxiv:0803.3553v1 [cs.it] 25 Mar 2008 Carl Bracken School of Mathematical Sciences University College Dublin Ireland May 30, 2018 Abstract
More information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
More informationOn the construction of asymmetric orthogonal arrays
isid/ms/2015/03 March 05, 2015 http://wwwisidacin/ statmath/indexphp?module=preprint On the construction of asymmetric orthogonal arrays Tianfang Zhang and Aloke Dey Indian Statistical Institute, Delhi
More informationConstruction X for quantum error-correcting codes
Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from
More informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
More informationAn Extremal Doubly Even Self-Dual Code of Length 112
An Extremal Doubly Even Self-Dual Code of Length 112 Masaaki Harada Department of Mathematical Sciences Yamagata University Yamagata 990 8560, Japan mharada@sci.kj.yamagata-u.ac.jp Submitted: Dec 29, 2007;
More informationStatistical Design and Analysis of Experiments Part Two
0.1 Statistical Design and Analysis of Experiments Part Two Lecture notes Fall semester 2007 Henrik Spliid nformatics and Mathematical Modelling Technical University of Denmark List of contents, cont.
More informationE(s 2 )-OPTIMAL SUPERSATURATED DESIGNS
Statistica Sinica 7(1997), 929-939 E(s 2 )-OPTIMAL SUPERSATURATED DESIGNS Ching-Shui Cheng University of California, Berkeley Abstract: Tang and Wu (1997) derived a lower bound on the E(s 2 )-value of
More informationLecture 12: 2 k p Fractional Factorial Design
Lecture 12: 2 k p Fractional Factorial Design Montgomery: Chapter 8 Page 1 Fundamental Principles Regarding Factorial Effects Suppose there are k factors (A,B,...,J,K) in an experiment. All possible factorial
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More information23. Fractional factorials - introduction
173 3. Fractional factorials - introduction Consider a 5 factorial. Even without replicates, there are 5 = 3 obs ns required to estimate the effects - 5 main effects, 10 two factor interactions, 10 three
More informationStatistica Sinica Preprint No: SS R1
Statistica Sinica Preprint No: SS-2015-0161R1 Title Generators for Nonregular $2^{k-p}$ Designs Manuscript ID SS-2015-0161R1 URL http://www.stat.sinica.edu.tw/statistica/ DOI 10.5705/ss.202015.0161 Complete
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
More informationCONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS
Statistica Sinica 23 (2013), 451-466 doi:http://dx.doi.org/10.5705/ss.2011.092 CONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS Jun Li and Peter Z. G. Qian Opera Solutions and
More informationSoo King Lim Figure 1: Figure 2: Figure 3: Figure 4: Figure 5: Figure 6: Figure 7: Figure 8: Figure 9: Figure 10: Figure 11: Figure 12: Figure 13:
1.0 ial Experiment Design by Block... 3 1.1 ial Experiment in Incomplete Block... 3 1. ial Experiment with Two Blocks... 3 1.3 ial Experiment with Four Blocks... 5 Example 1... 6.0 Fractional ial Experiment....1
More informationSelf-Dual Cyclic Codes
Self-Dual Cyclic Codes Bas Heijne November 29, 2007 Definitions Definition Let F be the finite field with two elements and n a positive integer. An [n, k] (block)-code C is a k dimensional linear subspace
More informationChapter 6 Lagrange Codes
Chapter 6 Lagrange Codes 6. Introduction Joseph Louis Lagrange was a famous eighteenth century Italian mathematician [] credited with minimum degree polynomial interpolation amongst his many other achievements.
More informationA Note on Non-Existence of (8,4)-2 Burst Error Correcting Code
Applied Mathematical Sciences, Vol. 4, 2010, no. 44, 2201-2205 A Note on Non-Existence of (8,4)-2 Burst Error Correcting Code Navneet Singh Rana Research Scholar, Department of Mathematics University of
More informationA Projection Decoding of a Binary Extremal Self-Dual Code of Length 40
A Projection Decoding of a Binary Extremal Self-Dual Code of Length 4 arxiv:7.48v [cs.it] 6 Jan 27 Jon-Lark Kim Department of Mathematics Sogang University Seoul, 2-742, South Korea jlkim@sogang.ac.kr
More informationAffine designs and linear orthogonal arrays
Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved
More informationCorrecting Codes in Cryptography
EWSCS 06 Palmse, Estonia 5-10 March 2006 Lecture 2: Orthogonal Arrays and Error- Correcting Codes in Cryptography James L. Massey Prof.-em. ETH Zürich, Adjunct Prof., Lund Univ., Sweden, and Tech. Univ.
More informationUSE OF COMPUTER EXPERIMENTS TO STUDY THE QUALITATIVE BEHAVIOR OF SOLUTIONS OF SECOND ORDER NEUTRAL DIFFERENTIAL EQUATIONS
USE OF COMPUTER EXPERIMENTS TO STUDY THE QUALITATIVE BEHAVIOR OF SOLUTIONS OF SECOND ORDER NEUTRAL DIFFERENTIAL EQUATIONS Seshadev Padhi, Manish Trivedi and Soubhik Chakraborty* Department of Applied Mathematics
More informationActa Mathematica Sinica, English Series Springer-Verlag Berlin Heidelberg & The Editorial Office of AMS 2015
Acta Mathematica Sinica, English Series Jul., 2015, Vol. 31, No. 7, pp. 1163 1170 Published online: June 15, 2015 DOI: 10.1007/s10114-015-3616-y Http://www.ActaMath.com Acta Mathematica Sinica, English
More informationQUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS
Statistica Sinica 12(2002), 905-916 QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Kashinath Chatterjee, Ashish Das and Aloke Dey Asutosh College, Calcutta and Indian Statistical Institute,
More information19. Blocking & confounding
146 19. Blocking & confounding Importance of blocking to control nuisance factors - day of week, batch of raw material, etc. Complete Blocks. This is the easy case. Suppose we run a 2 2 factorial experiment,
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationOptimal and Near-Optimal Pairs for the Estimation of Effects in 2-level Choice Experiments
Optimal and Near-Optimal Pairs for the Estimation of Effects in 2-level Choice Experiments Deborah J. Street Department of Mathematical Sciences, University of Technology, Sydney. Leonie Burgess Department
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
More information