Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
Combinatorial aspects of covering arrays
oleh: Charles J. Colbourn
| Format: | Article |
|---|---|
| Diterbitkan: | Università degli Studi di Catania 2004-11-01 |
Deskripsi
Covering arrays generalize orthogonal arrays by requiring that <em>t</em> -tuples be covered, but not requiring that the appearance of <em>t</em> -tuples be balanced.<br />Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.<br />