Covering Arrays of Strength Three |
| |
| Authors: | M A Chateauneuf Charles J Colbourn D L Kreher |
| |
| Institution: | (1) Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan, 49931-1295;(2) Department of Computer Science, University of Vermont, Burlington, Vermont, 05405 |
| |
| Abstract: | A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software
testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength
three. |
| |
| Keywords: | covering array orthogonal array group action perfect hash family |
| 本文献已被 SpringerLink 等数据库收录！ |
|
