| t-维组合覆盖阵的递归构建 |
| |
| 引用本文： | 查日军,张德平,徐宝文.t-维组合覆盖阵的递归构建[J].东南大学学报,2011(3):340-342. |
| |
| 作者姓名： | 查日军 张德平 徐宝文 |
| |
| 作者单位： | 东南大学计算机科学与工程学院;南京航空航天大学计算机科学与技术学院;南京大学计算机软件新技术国家重点实验室; |
| |
| 基金项目： | 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) |
| |
| 摘 要： | 一个大小为N、度为k、取值为v、强度为f的t-维组合覆盖阵是一个N×k矩阵,其取值为v的符号集,并且任意N×t子矩阵的行都至少包含取值为v符号集的任一f元组一次.提出了一种基于差阵的t-维组合覆盖阵代数递归构建新方法,该方法在已有的覆盖阵基础上可大规模地扩展参数个数,实现任意f个参数组合的有效覆盖(t≥2),是一种实用...
|
| 关 键 词： | 覆盖阵 正交阵 差阵 |
Recursive constructions for t-covering arrays |
| |
| Zha Rijun Zhang Deping Xu Baowen.Recursive constructions for t-covering arrays[J].Journal of Southeast University(English Edition),2011(3):340-342. |
| |
| Authors: | Zha Rijun Zhang Deping Xu Baowen |
| |
| Institution: | Zha Rijun1 Zhang Deping2 Xu Baowen3(1School of Computer Science and Engineering,Southeast University,Nanjing 210096,China)(2 College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China)(3State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093,China) |
| |
| Abstract: | A t-covering array of size N,degree k,order v and strength t is an N×k array with entries from a set of v symbols such that any N×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. |
| |
| Keywords: | covering array orthogonal array difference matrix |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
