Recursive constructions for t-covering arrays  

t-维组合覆盖阵的递归构建(英文)

作　　者：查日军[1] 张德平[2] 徐宝文[3] 

机构地区：[1]东南大学计算机科学与工程学院,南京210096 [2]南京航空航天大学计算机科学与技术学院,南京210016 [3]南京大学计算机软件新技术国家重点实验室,南京210093

出　　处：《Journal of Southeast University(English Edition)》2011年第3期340-342,共3页东南大学学报（英文版）

基　　金：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.一个大小为N、度为k、取值为v、强度为t的t-维组合覆盖阵是一个N×k矩阵,其取值为v的符号集,并且任意N×t子矩阵的行都至少包含取值为v符号集的任一t元组一次.提出了一种基于差阵的t-维组合覆盖阵代数递归构建新方法,该方法在已有的覆盖阵基础上可大规模地扩展参数个数,实现任意t个参数组合的有效覆盖(t≥2),是一种实用的生成高维组合覆盖阵代数递归新方法.同时,给出了该新方法的理论推导与算法实现.

关 键 词：covering array orthogonal array difference matrix 

分 类 号：TP306[自动化与计算机技术—计算机系统结构]