Combinatorial aspects of covering arrays
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, a...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2004-11-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166 |
| _version_ | 1818042332989095936 |
|---|---|
| author | Charles J. Colbourn |
| author_facet | Charles J. Colbourn |
| author_sort | Charles J. Colbourn |
| collection | DOAJ |
| description | 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 /> |
| first_indexed | 2024-12-10T08:44:39Z |
| format | Article |
| id | doaj.art-0a62f2aeb2e44e1d9a32d43c672193e8 |
| institution | Directory Open Access Journal |
| issn | 0373-3505 2037-5298 |
| language | English |
| last_indexed | 2024-12-10T08:44:39Z |
| publishDate | 2004-11-01 |
| publisher | Università degli Studi di Catania |
| record_format | Article |
| series | Le Matematiche |
| spelling | doaj.art-0a62f2aeb2e44e1d9a32d43c672193e82022-12-22T01:55:46ZengUniversità degli Studi di CataniaLe Matematiche0373-35052037-52982004-11-01591,2125172144Combinatorial aspects of covering arraysCharles J. ColbournCovering 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 />http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166Covering arrayQualitative independencetransversal coverOrthogonal arrayTransversal designPerfect hash familyInteraction testingGroup-divisible designsHeuristic searchGreedy algorithm |
| spellingShingle | Charles J. Colbourn Combinatorial aspects of covering arrays Le Matematiche Covering array Qualitative independence transversal cover Orthogonal array Transversal design Perfect hash family Interaction testing Group-divisible designs Heuristic search Greedy algorithm |
| title | Combinatorial aspects of covering arrays |
| title_full | Combinatorial aspects of covering arrays |
| title_fullStr | Combinatorial aspects of covering arrays |
| title_full_unstemmed | Combinatorial aspects of covering arrays |
| title_short | Combinatorial aspects of covering arrays |
| title_sort | combinatorial aspects of covering arrays |
| topic | Covering array Qualitative independence transversal cover Orthogonal array Transversal design Perfect hash family Interaction testing Group-divisible designs Heuristic search Greedy algorithm |
| url | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166 |
| work_keys_str_mv | AT charlesjcolbourn combinatorialaspectsofcoveringarrays |