Construction of orthogonal arrays of strength three by augmented difference schemes
Introduction
Orthogonal arrays (OAs) are essential in statistics. They are used primarily for designing experiments and are therefore vital in all areas of human science, including medicine, agriculture, and manufacturing. Moreover, OAs have potential applications in areas such as quantum information theory [9], [10], [23], cryptography [6], wireless sensor networks [8], [19] and computer science. In Tang's paper [33], the constructed Latin hypercube designs based on OAs have attractive space-filling property and space-filling designs have been appropriate designs for computer experiments [7], [35]. In a big data era, OAs of high strength are applied to high-dimensional data processing in computer experiments [1], [25], [32], [37]. Orthogonal arrays have played and continue to play a prominent role. Because of their powerful applications, many researchers devoted themselves to constructing more OAs. The construction of OAs of strength two has been extensively studied such as [16], [18], [24], [40], [41], [42], however, methods for constructing OAs of high strength have not been studied as extensively as those of strength two. A general construction method for OAs with all factors having prime power levels of strength three and four is proposed in [30], [31]. Based on [30], [31], Zhang et al. in [38], [39] explored the replacement procedure to obtain certain new families of OAs of strength three. Another general construction method for the OAs of high strength by using an orthogonal partition is presented in [20], [21], [22]. Although there have been multiple efforts for constructing OAs of high strength, many unsolved problems persist. Therefore, there is an urgent need for better methods for constructing OAs of high strength.
Difference schemes are a simple but powerful tool for the construction of OAs. The most interesting application for schemes with two levels was proposed by Seiden et al. [27], [28]. Other results, mostly for strength two or three, were proposed in [17]. Wang et al. [34] studied a resolvable generalized difference matrix of strength t. Hedayat et al. [14] investigated the existence of difference schemes of high strength and provided certain difference schemes with levels . Moreover, for prime power , Chen et al. [4] presented a method for obtaining a difference scheme while t-simple matrices are constructed in [5], [15], which are closely related to difference schemes and . Although difference schemes of high strength are a natural generalization of ordinary difference schemes, it is more difficult to construct useful schemes of high strength. Therefore, they have to date had limited application because of the accompanying challenging problems [13].
In this study, we define augmented difference schemes, which are a generalization of difference schemes, and present a general method for constructing such schemes of strength three. As an application of the proposed method, we construct difference schemes with any number of levels, including with the maximal value c for any prime power d. Furthermore, a large number of new OAs of strength three can be obtained using the newly constructed difference schemes, including many tight arrays. Accordingly, we provide a positive answer to two open problems in [13]: (1) how to develop new methods for the construction of difference schemes of high strength with the ultimate goal of obtaining better OAs of high strength and (2) how to develop better methods and tools for the construction of OAs.
Section snippets
Preliminaries
Let be the transposition of the matrix A and . Let and denote the vectors of 0s and 1s, respectively. Let be an abelian group of order d. The Kronecker product is defined in [13] and Kronecker sum is the Kronecker product with multiplication replaced by addition on . For convenience, we usually denote all elements of Galois field by . Let be a matrix whose rows are all possible m-tuples over and denote a Hadamard matrix of
Main results
Theorem 1 For , let be an matrix over GF(d), where , , and . If any three columns of each are linearly independent, then is an augmented difference scheme . In particular, if , then is an .
Proof It is clear that Since any three columns of are linearly independent, is an [30]. Then is a
Conclusion
In this study, we presented a general method for constructing augmented difference schemes of strength three. As an application of the proposed method, we constructed difference schemes with any number of levels. In particular, we included some optimal difference schemes. Furthermore, new infinite families of OAs of strength three can be obtained. Thus, we provided a positive answer to two open problems in [13]. In addition, a Latin hypercube based on the newly constructed orthogonal array will
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant No. 11971004).
References (42)
- et al.
On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
J. Stat. Plan. Inference
(1997) - et al.
On difference schemes and orthogonal arrays of strength t
J. Stat. Plan. Inference
(1996) - et al.
t-CIS codes over GF(p) and orthogonal arrays
Discrete Appl. Math.
(2017) - et al.
Construction of asymmetric orthogonal arrays through finite geometries
J. Stat. Plan. Inference
(2003) - et al.
Resolvable generalized difference matrices: existence and applications
Finite Fields Appl.
(2016) - et al.
Construction of space-filling orthogonal designs
J. Stat. Plan. Inference
(2021) - et al.
On the construction of asymmetric orthogonal arrays
J. Stat. Plan. Inference
(2016) - et al.
Orthogonal arrays obtained by the generalized Hadamard product
Discrete Math.
(2001) - et al.
A general theory for orthogonal array based Latin hypercube sampling
Stat. Sin.
(2016) - et al.
Structured Hadamard conjecture
Springer Proc. Math. Stat.
(2013)
The existence of mixed orthogonal arrays with four and five factors of strength two
J. Comb. Des.
Constructions of mixed orthogonal arrays of strength three
Sci. Sin., Math.
A new recursive construction for optical orthogonal codes
IEEE Trans. Inf. Theory
New constructions of q-variable 1-resilient rotation symmetric functions over
Sci. China Inf. Sci.
Design and Modeling for Computer Experiments
A combinatorial key predistribution scheme for two-layer hierarchical wireless sensor networks
Wirel. Pers. Commun.
Multipartite entanglement in heterogeneous systems
Phys. Rev. A
Genuinely multipartite entangled states and orthogonal arrays
Phys. Rev. A
A note on the quadratic character on finite fields
J. Nanjing Univ. Math. Biq.
Orthogonal Arrays: Theory and Applications
Asymptotically optimal optical orthogonal signature pattern codes
IEEE Trans. Inf. Theory
Cited by (4)
Constructions for new orthogonal arrays based on large sets of orthogonal arrays
2023, Designs, Codes, and CryptographyOn the Construction of Variable Strength Orthogonal Arrays
2023, IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesHamming distances of tight orthogonal arrays
2023, Communications in Statistics - Theory and Methods