A t-covering array of size N, degree k, order v and strength t is an N x k array with entries from a set of v symbols such that any N x t subarray contains a t-tuple of v symbols at least once as a row. This paper pre...A t-covering array of size N, degree k, order v and strength t is an N x k array with entries from a set of v symbols such that any N x t subarray contains a t-tuple of v symbols at least once as a row. This paper presents a new algebraic recursive method for constructing covering arrays based on difference matrices. The method can extend parameter factors on the existing covering arrays and cover all the combinations of any t parameter factors （t≥2）. The method, which recursively generates high strength covering arrays, is practical. Meanwhile, the theoretical derivation and realization of the proposed algebraic recursive algorithm are given.展开更多
基金The National Natural Science Foundation of China (No.90818027, 61003020, 91018005, 60873050)the National High Technology Research and Development Program of China (863 Program ) (No.2009AA01Z147)the National Basic Research Program of China (973 Program) ( No. 2009CB320703)
文摘A t-covering array of size N, degree k, order v and strength t is an N x k array with entries from a set of v symbols such that any N x t subarray contains a t-tuple of v symbols at least once as a row. This paper presents a new algebraic recursive method for constructing covering arrays based on difference matrices. The method can extend parameter factors on the existing covering arrays and cover all the combinations of any t parameter factors （t≥2）. The method, which recursively generates high strength covering arrays, is practical. Meanwhile, the theoretical derivation and realization of the proposed algebraic recursive algorithm are given.
