首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Covering arrays of higher strength from permutation vectors
Authors:George B Sherwood  Sosina S Martirosyan  Charles J Colbourn
Abstract:A covering array CA(N;t,k,v) is an N × k array such that every N × t sub‐array contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 202–213, 2006
Keywords:covering array  orthogonal array  perfect hash family  permutation vector
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号