Covering Arrays for Equivalence Classes of Words
Covering arrays for words of length t over a d letter alphabet are k × n arrays with entries from the alphabet so that for each choice of t columns, each of the dt t-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2018
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/honors/446 https://dc.etsu.edu/cgi/viewcontent.cgi?article=1492&context=honors |