Open Journal of Statistics

Volume 2, Issue 2 (April 2012)

ISSN Print: 2161-718X   ISSN Online: 2161-7198

Google-based Impact Factor: 0.53  Citations  

On a Grouping Method for Constructing Mixed Orthogonal Arrays

HTML  Download Download as PDF (Size: 310KB)  PP. 188-197  
DOI: 10.4236/ojs.2012.22022    3,919 Downloads   6,503 Views  Citations
Author(s)

ABSTRACT

Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0<i<(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.

Share and Cite:

C. Suen, "On a Grouping Method for Constructing Mixed Orthogonal Arrays," Open Journal of Statistics, Vol. 2 No. 2, 2012, pp. 188-197. doi: 10.4236/ojs.2012.22022.

Cited by

[1] The Existence of a Class of Mixed Orthogonal Arrays
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, 2016
[2] 强度 3 的混合正交表的构造
2013
[3] Constructions of mixed orthogonal arrays of strength three
SCIENCE CHINA Mathematics, 2013

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.